1 //===-- TargetLoweringBase.cpp - Implement the TargetLoweringBase class ---===// 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 the TargetLoweringBase class. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "llvm/Target/TargetLowering.h" 15 #include "llvm/ADT/BitVector.h" 16 #include "llvm/ADT/STLExtras.h" 17 #include "llvm/ADT/Triple.h" 18 #include "llvm/CodeGen/Analysis.h" 19 #include "llvm/CodeGen/MachineFrameInfo.h" 20 #include "llvm/CodeGen/MachineFunction.h" 21 #include "llvm/CodeGen/MachineInstrBuilder.h" 22 #include "llvm/CodeGen/MachineJumpTableInfo.h" 23 #include "llvm/CodeGen/StackMaps.h" 24 #include "llvm/IR/DataLayout.h" 25 #include "llvm/IR/DerivedTypes.h" 26 #include "llvm/IR/GlobalVariable.h" 27 #include "llvm/IR/Mangler.h" 28 #include "llvm/MC/MCAsmInfo.h" 29 #include "llvm/MC/MCContext.h" 30 #include "llvm/MC/MCExpr.h" 31 #include "llvm/Support/BranchProbability.h" 32 #include "llvm/Support/CommandLine.h" 33 #include "llvm/Support/ErrorHandling.h" 34 #include "llvm/Support/MathExtras.h" 35 #include "llvm/Target/TargetLoweringObjectFile.h" 36 #include "llvm/Target/TargetMachine.h" 37 #include "llvm/Target/TargetRegisterInfo.h" 38 #include "llvm/Target/TargetSubtargetInfo.h" 39 #include <cctype> 40 using namespace llvm; 41 42 static cl::opt<bool> JumpIsExpensiveOverride( 43 "jump-is-expensive", cl::init(false), 44 cl::desc("Do not create extra branches to split comparison logic."), 45 cl::Hidden); 46 47 // Although this default value is arbitrary, it is not random. It is assumed 48 // that a condition that evaluates the same way by a higher percentage than this 49 // is best represented as control flow. Therefore, the default value N should be 50 // set such that the win from N% correct executions is greater than the loss 51 // from (100 - N)% mispredicted executions for the majority of intended targets. 52 static cl::opt<int> MinPercentageForPredictableBranch( 53 "min-predictable-branch", cl::init(99), 54 cl::desc("Minimum percentage (0-100) that a condition must be either true " 55 "or false to assume that the condition is predictable"), 56 cl::Hidden); 57 58 /// InitLibcallNames - Set default libcall names. 59 /// 60 static void InitLibcallNames(const char **Names, const Triple &TT) { 61 Names[RTLIB::SHL_I16] = "__ashlhi3"; 62 Names[RTLIB::SHL_I32] = "__ashlsi3"; 63 Names[RTLIB::SHL_I64] = "__ashldi3"; 64 Names[RTLIB::SHL_I128] = "__ashlti3"; 65 Names[RTLIB::SRL_I16] = "__lshrhi3"; 66 Names[RTLIB::SRL_I32] = "__lshrsi3"; 67 Names[RTLIB::SRL_I64] = "__lshrdi3"; 68 Names[RTLIB::SRL_I128] = "__lshrti3"; 69 Names[RTLIB::SRA_I16] = "__ashrhi3"; 70 Names[RTLIB::SRA_I32] = "__ashrsi3"; 71 Names[RTLIB::SRA_I64] = "__ashrdi3"; 72 Names[RTLIB::SRA_I128] = "__ashrti3"; 73 Names[RTLIB::MUL_I8] = "__mulqi3"; 74 Names[RTLIB::MUL_I16] = "__mulhi3"; 75 Names[RTLIB::MUL_I32] = "__mulsi3"; 76 Names[RTLIB::MUL_I64] = "__muldi3"; 77 Names[RTLIB::MUL_I128] = "__multi3"; 78 Names[RTLIB::MULO_I32] = "__mulosi4"; 79 Names[RTLIB::MULO_I64] = "__mulodi4"; 80 Names[RTLIB::MULO_I128] = "__muloti4"; 81 Names[RTLIB::SDIV_I8] = "__divqi3"; 82 Names[RTLIB::SDIV_I16] = "__divhi3"; 83 Names[RTLIB::SDIV_I32] = "__divsi3"; 84 Names[RTLIB::SDIV_I64] = "__divdi3"; 85 Names[RTLIB::SDIV_I128] = "__divti3"; 86 Names[RTLIB::UDIV_I8] = "__udivqi3"; 87 Names[RTLIB::UDIV_I16] = "__udivhi3"; 88 Names[RTLIB::UDIV_I32] = "__udivsi3"; 89 Names[RTLIB::UDIV_I64] = "__udivdi3"; 90 Names[RTLIB::UDIV_I128] = "__udivti3"; 91 Names[RTLIB::SREM_I8] = "__modqi3"; 92 Names[RTLIB::SREM_I16] = "__modhi3"; 93 Names[RTLIB::SREM_I32] = "__modsi3"; 94 Names[RTLIB::SREM_I64] = "__moddi3"; 95 Names[RTLIB::SREM_I128] = "__modti3"; 96 Names[RTLIB::UREM_I8] = "__umodqi3"; 97 Names[RTLIB::UREM_I16] = "__umodhi3"; 98 Names[RTLIB::UREM_I32] = "__umodsi3"; 99 Names[RTLIB::UREM_I64] = "__umoddi3"; 100 Names[RTLIB::UREM_I128] = "__umodti3"; 101 102 Names[RTLIB::NEG_I32] = "__negsi2"; 103 Names[RTLIB::NEG_I64] = "__negdi2"; 104 Names[RTLIB::ADD_F32] = "__addsf3"; 105 Names[RTLIB::ADD_F64] = "__adddf3"; 106 Names[RTLIB::ADD_F80] = "__addxf3"; 107 Names[RTLIB::ADD_F128] = "__addtf3"; 108 Names[RTLIB::ADD_PPCF128] = "__gcc_qadd"; 109 Names[RTLIB::SUB_F32] = "__subsf3"; 110 Names[RTLIB::SUB_F64] = "__subdf3"; 111 Names[RTLIB::SUB_F80] = "__subxf3"; 112 Names[RTLIB::SUB_F128] = "__subtf3"; 113 Names[RTLIB::SUB_PPCF128] = "__gcc_qsub"; 114 Names[RTLIB::MUL_F32] = "__mulsf3"; 115 Names[RTLIB::MUL_F64] = "__muldf3"; 116 Names[RTLIB::MUL_F80] = "__mulxf3"; 117 Names[RTLIB::MUL_F128] = "__multf3"; 118 Names[RTLIB::MUL_PPCF128] = "__gcc_qmul"; 119 Names[RTLIB::DIV_F32] = "__divsf3"; 120 Names[RTLIB::DIV_F64] = "__divdf3"; 121 Names[RTLIB::DIV_F80] = "__divxf3"; 122 Names[RTLIB::DIV_F128] = "__divtf3"; 123 Names[RTLIB::DIV_PPCF128] = "__gcc_qdiv"; 124 Names[RTLIB::REM_F32] = "fmodf"; 125 Names[RTLIB::REM_F64] = "fmod"; 126 Names[RTLIB::REM_F80] = "fmodl"; 127 Names[RTLIB::REM_F128] = "fmodl"; 128 Names[RTLIB::REM_PPCF128] = "fmodl"; 129 Names[RTLIB::FMA_F32] = "fmaf"; 130 Names[RTLIB::FMA_F64] = "fma"; 131 Names[RTLIB::FMA_F80] = "fmal"; 132 Names[RTLIB::FMA_F128] = "fmal"; 133 Names[RTLIB::FMA_PPCF128] = "fmal"; 134 Names[RTLIB::POWI_F32] = "__powisf2"; 135 Names[RTLIB::POWI_F64] = "__powidf2"; 136 Names[RTLIB::POWI_F80] = "__powixf2"; 137 Names[RTLIB::POWI_F128] = "__powitf2"; 138 Names[RTLIB::POWI_PPCF128] = "__powitf2"; 139 Names[RTLIB::SQRT_F32] = "sqrtf"; 140 Names[RTLIB::SQRT_F64] = "sqrt"; 141 Names[RTLIB::SQRT_F80] = "sqrtl"; 142 Names[RTLIB::SQRT_F128] = "sqrtl"; 143 Names[RTLIB::SQRT_PPCF128] = "sqrtl"; 144 Names[RTLIB::LOG_F32] = "logf"; 145 Names[RTLIB::LOG_F64] = "log"; 146 Names[RTLIB::LOG_F80] = "logl"; 147 Names[RTLIB::LOG_F128] = "logl"; 148 Names[RTLIB::LOG_PPCF128] = "logl"; 149 Names[RTLIB::LOG2_F32] = "log2f"; 150 Names[RTLIB::LOG2_F64] = "log2"; 151 Names[RTLIB::LOG2_F80] = "log2l"; 152 Names[RTLIB::LOG2_F128] = "log2l"; 153 Names[RTLIB::LOG2_PPCF128] = "log2l"; 154 Names[RTLIB::LOG10_F32] = "log10f"; 155 Names[RTLIB::LOG10_F64] = "log10"; 156 Names[RTLIB::LOG10_F80] = "log10l"; 157 Names[RTLIB::LOG10_F128] = "log10l"; 158 Names[RTLIB::LOG10_PPCF128] = "log10l"; 159 Names[RTLIB::EXP_F32] = "expf"; 160 Names[RTLIB::EXP_F64] = "exp"; 161 Names[RTLIB::EXP_F80] = "expl"; 162 Names[RTLIB::EXP_F128] = "expl"; 163 Names[RTLIB::EXP_PPCF128] = "expl"; 164 Names[RTLIB::EXP2_F32] = "exp2f"; 165 Names[RTLIB::EXP2_F64] = "exp2"; 166 Names[RTLIB::EXP2_F80] = "exp2l"; 167 Names[RTLIB::EXP2_F128] = "exp2l"; 168 Names[RTLIB::EXP2_PPCF128] = "exp2l"; 169 Names[RTLIB::SIN_F32] = "sinf"; 170 Names[RTLIB::SIN_F64] = "sin"; 171 Names[RTLIB::SIN_F80] = "sinl"; 172 Names[RTLIB::SIN_F128] = "sinl"; 173 Names[RTLIB::SIN_PPCF128] = "sinl"; 174 Names[RTLIB::COS_F32] = "cosf"; 175 Names[RTLIB::COS_F64] = "cos"; 176 Names[RTLIB::COS_F80] = "cosl"; 177 Names[RTLIB::COS_F128] = "cosl"; 178 Names[RTLIB::COS_PPCF128] = "cosl"; 179 Names[RTLIB::POW_F32] = "powf"; 180 Names[RTLIB::POW_F64] = "pow"; 181 Names[RTLIB::POW_F80] = "powl"; 182 Names[RTLIB::POW_F128] = "powl"; 183 Names[RTLIB::POW_PPCF128] = "powl"; 184 Names[RTLIB::CEIL_F32] = "ceilf"; 185 Names[RTLIB::CEIL_F64] = "ceil"; 186 Names[RTLIB::CEIL_F80] = "ceill"; 187 Names[RTLIB::CEIL_F128] = "ceill"; 188 Names[RTLIB::CEIL_PPCF128] = "ceill"; 189 Names[RTLIB::TRUNC_F32] = "truncf"; 190 Names[RTLIB::TRUNC_F64] = "trunc"; 191 Names[RTLIB::TRUNC_F80] = "truncl"; 192 Names[RTLIB::TRUNC_F128] = "truncl"; 193 Names[RTLIB::TRUNC_PPCF128] = "truncl"; 194 Names[RTLIB::RINT_F32] = "rintf"; 195 Names[RTLIB::RINT_F64] = "rint"; 196 Names[RTLIB::RINT_F80] = "rintl"; 197 Names[RTLIB::RINT_F128] = "rintl"; 198 Names[RTLIB::RINT_PPCF128] = "rintl"; 199 Names[RTLIB::NEARBYINT_F32] = "nearbyintf"; 200 Names[RTLIB::NEARBYINT_F64] = "nearbyint"; 201 Names[RTLIB::NEARBYINT_F80] = "nearbyintl"; 202 Names[RTLIB::NEARBYINT_F128] = "nearbyintl"; 203 Names[RTLIB::NEARBYINT_PPCF128] = "nearbyintl"; 204 Names[RTLIB::ROUND_F32] = "roundf"; 205 Names[RTLIB::ROUND_F64] = "round"; 206 Names[RTLIB::ROUND_F80] = "roundl"; 207 Names[RTLIB::ROUND_F128] = "roundl"; 208 Names[RTLIB::ROUND_PPCF128] = "roundl"; 209 Names[RTLIB::FLOOR_F32] = "floorf"; 210 Names[RTLIB::FLOOR_F64] = "floor"; 211 Names[RTLIB::FLOOR_F80] = "floorl"; 212 Names[RTLIB::FLOOR_F128] = "floorl"; 213 Names[RTLIB::FLOOR_PPCF128] = "floorl"; 214 Names[RTLIB::FMIN_F32] = "fminf"; 215 Names[RTLIB::FMIN_F64] = "fmin"; 216 Names[RTLIB::FMIN_F80] = "fminl"; 217 Names[RTLIB::FMIN_F128] = "fminl"; 218 Names[RTLIB::FMIN_PPCF128] = "fminl"; 219 Names[RTLIB::FMAX_F32] = "fmaxf"; 220 Names[RTLIB::FMAX_F64] = "fmax"; 221 Names[RTLIB::FMAX_F80] = "fmaxl"; 222 Names[RTLIB::FMAX_F128] = "fmaxl"; 223 Names[RTLIB::FMAX_PPCF128] = "fmaxl"; 224 Names[RTLIB::ROUND_F32] = "roundf"; 225 Names[RTLIB::ROUND_F64] = "round"; 226 Names[RTLIB::ROUND_F80] = "roundl"; 227 Names[RTLIB::ROUND_F128] = "roundl"; 228 Names[RTLIB::ROUND_PPCF128] = "roundl"; 229 Names[RTLIB::COPYSIGN_F32] = "copysignf"; 230 Names[RTLIB::COPYSIGN_F64] = "copysign"; 231 Names[RTLIB::COPYSIGN_F80] = "copysignl"; 232 Names[RTLIB::COPYSIGN_F128] = "copysignl"; 233 Names[RTLIB::COPYSIGN_PPCF128] = "copysignl"; 234 Names[RTLIB::FPEXT_F32_PPCF128] = "__gcc_stoq"; 235 Names[RTLIB::FPEXT_F64_PPCF128] = "__gcc_dtoq"; 236 Names[RTLIB::FPEXT_F64_F128] = "__extenddftf2"; 237 Names[RTLIB::FPEXT_F32_F128] = "__extendsftf2"; 238 Names[RTLIB::FPEXT_F32_F64] = "__extendsfdf2"; 239 if (TT.isOSDarwin()) { 240 // For f16/f32 conversions, Darwin uses the standard naming scheme, instead 241 // of the gnueabi-style __gnu_*_ieee. 242 // FIXME: What about other targets? 243 Names[RTLIB::FPEXT_F16_F32] = "__extendhfsf2"; 244 Names[RTLIB::FPROUND_F32_F16] = "__truncsfhf2"; 245 } else { 246 Names[RTLIB::FPEXT_F16_F32] = "__gnu_h2f_ieee"; 247 Names[RTLIB::FPROUND_F32_F16] = "__gnu_f2h_ieee"; 248 } 249 Names[RTLIB::FPROUND_F64_F16] = "__truncdfhf2"; 250 Names[RTLIB::FPROUND_F80_F16] = "__truncxfhf2"; 251 Names[RTLIB::FPROUND_F128_F16] = "__trunctfhf2"; 252 Names[RTLIB::FPROUND_PPCF128_F16] = "__trunctfhf2"; 253 Names[RTLIB::FPROUND_F64_F32] = "__truncdfsf2"; 254 Names[RTLIB::FPROUND_F80_F32] = "__truncxfsf2"; 255 Names[RTLIB::FPROUND_F128_F32] = "__trunctfsf2"; 256 Names[RTLIB::FPROUND_PPCF128_F32] = "__gcc_qtos"; 257 Names[RTLIB::FPROUND_F80_F64] = "__truncxfdf2"; 258 Names[RTLIB::FPROUND_F128_F64] = "__trunctfdf2"; 259 Names[RTLIB::FPROUND_PPCF128_F64] = "__gcc_qtod"; 260 Names[RTLIB::FPTOSINT_F32_I32] = "__fixsfsi"; 261 Names[RTLIB::FPTOSINT_F32_I64] = "__fixsfdi"; 262 Names[RTLIB::FPTOSINT_F32_I128] = "__fixsfti"; 263 Names[RTLIB::FPTOSINT_F64_I32] = "__fixdfsi"; 264 Names[RTLIB::FPTOSINT_F64_I64] = "__fixdfdi"; 265 Names[RTLIB::FPTOSINT_F64_I128] = "__fixdfti"; 266 Names[RTLIB::FPTOSINT_F80_I32] = "__fixxfsi"; 267 Names[RTLIB::FPTOSINT_F80_I64] = "__fixxfdi"; 268 Names[RTLIB::FPTOSINT_F80_I128] = "__fixxfti"; 269 Names[RTLIB::FPTOSINT_F128_I32] = "__fixtfsi"; 270 Names[RTLIB::FPTOSINT_F128_I64] = "__fixtfdi"; 271 Names[RTLIB::FPTOSINT_F128_I128] = "__fixtfti"; 272 Names[RTLIB::FPTOSINT_PPCF128_I32] = "__gcc_qtou"; 273 Names[RTLIB::FPTOSINT_PPCF128_I64] = "__fixtfdi"; 274 Names[RTLIB::FPTOSINT_PPCF128_I128] = "__fixtfti"; 275 Names[RTLIB::FPTOUINT_F32_I32] = "__fixunssfsi"; 276 Names[RTLIB::FPTOUINT_F32_I64] = "__fixunssfdi"; 277 Names[RTLIB::FPTOUINT_F32_I128] = "__fixunssfti"; 278 Names[RTLIB::FPTOUINT_F64_I32] = "__fixunsdfsi"; 279 Names[RTLIB::FPTOUINT_F64_I64] = "__fixunsdfdi"; 280 Names[RTLIB::FPTOUINT_F64_I128] = "__fixunsdfti"; 281 Names[RTLIB::FPTOUINT_F80_I32] = "__fixunsxfsi"; 282 Names[RTLIB::FPTOUINT_F80_I64] = "__fixunsxfdi"; 283 Names[RTLIB::FPTOUINT_F80_I128] = "__fixunsxfti"; 284 Names[RTLIB::FPTOUINT_F128_I32] = "__fixunstfsi"; 285 Names[RTLIB::FPTOUINT_F128_I64] = "__fixunstfdi"; 286 Names[RTLIB::FPTOUINT_F128_I128] = "__fixunstfti"; 287 Names[RTLIB::FPTOUINT_PPCF128_I32] = "__fixunstfsi"; 288 Names[RTLIB::FPTOUINT_PPCF128_I64] = "__fixunstfdi"; 289 Names[RTLIB::FPTOUINT_PPCF128_I128] = "__fixunstfti"; 290 Names[RTLIB::SINTTOFP_I32_F32] = "__floatsisf"; 291 Names[RTLIB::SINTTOFP_I32_F64] = "__floatsidf"; 292 Names[RTLIB::SINTTOFP_I32_F80] = "__floatsixf"; 293 Names[RTLIB::SINTTOFP_I32_F128] = "__floatsitf"; 294 Names[RTLIB::SINTTOFP_I32_PPCF128] = "__gcc_itoq"; 295 Names[RTLIB::SINTTOFP_I64_F32] = "__floatdisf"; 296 Names[RTLIB::SINTTOFP_I64_F64] = "__floatdidf"; 297 Names[RTLIB::SINTTOFP_I64_F80] = "__floatdixf"; 298 Names[RTLIB::SINTTOFP_I64_F128] = "__floatditf"; 299 Names[RTLIB::SINTTOFP_I64_PPCF128] = "__floatditf"; 300 Names[RTLIB::SINTTOFP_I128_F32] = "__floattisf"; 301 Names[RTLIB::SINTTOFP_I128_F64] = "__floattidf"; 302 Names[RTLIB::SINTTOFP_I128_F80] = "__floattixf"; 303 Names[RTLIB::SINTTOFP_I128_F128] = "__floattitf"; 304 Names[RTLIB::SINTTOFP_I128_PPCF128] = "__floattitf"; 305 Names[RTLIB::UINTTOFP_I32_F32] = "__floatunsisf"; 306 Names[RTLIB::UINTTOFP_I32_F64] = "__floatunsidf"; 307 Names[RTLIB::UINTTOFP_I32_F80] = "__floatunsixf"; 308 Names[RTLIB::UINTTOFP_I32_F128] = "__floatunsitf"; 309 Names[RTLIB::UINTTOFP_I32_PPCF128] = "__gcc_utoq"; 310 Names[RTLIB::UINTTOFP_I64_F32] = "__floatundisf"; 311 Names[RTLIB::UINTTOFP_I64_F64] = "__floatundidf"; 312 Names[RTLIB::UINTTOFP_I64_F80] = "__floatundixf"; 313 Names[RTLIB::UINTTOFP_I64_F128] = "__floatunditf"; 314 Names[RTLIB::UINTTOFP_I64_PPCF128] = "__floatunditf"; 315 Names[RTLIB::UINTTOFP_I128_F32] = "__floatuntisf"; 316 Names[RTLIB::UINTTOFP_I128_F64] = "__floatuntidf"; 317 Names[RTLIB::UINTTOFP_I128_F80] = "__floatuntixf"; 318 Names[RTLIB::UINTTOFP_I128_F128] = "__floatuntitf"; 319 Names[RTLIB::UINTTOFP_I128_PPCF128] = "__floatuntitf"; 320 Names[RTLIB::OEQ_F32] = "__eqsf2"; 321 Names[RTLIB::OEQ_F64] = "__eqdf2"; 322 Names[RTLIB::OEQ_F128] = "__eqtf2"; 323 Names[RTLIB::OEQ_PPCF128] = "__gcc_qeq"; 324 Names[RTLIB::UNE_F32] = "__nesf2"; 325 Names[RTLIB::UNE_F64] = "__nedf2"; 326 Names[RTLIB::UNE_F128] = "__netf2"; 327 Names[RTLIB::UNE_PPCF128] = "__gcc_qne"; 328 Names[RTLIB::OGE_F32] = "__gesf2"; 329 Names[RTLIB::OGE_F64] = "__gedf2"; 330 Names[RTLIB::OGE_F128] = "__getf2"; 331 Names[RTLIB::OGE_PPCF128] = "__gcc_qge"; 332 Names[RTLIB::OLT_F32] = "__ltsf2"; 333 Names[RTLIB::OLT_F64] = "__ltdf2"; 334 Names[RTLIB::OLT_F128] = "__lttf2"; 335 Names[RTLIB::OLT_PPCF128] = "__gcc_qlt"; 336 Names[RTLIB::OLE_F32] = "__lesf2"; 337 Names[RTLIB::OLE_F64] = "__ledf2"; 338 Names[RTLIB::OLE_F128] = "__letf2"; 339 Names[RTLIB::OLE_PPCF128] = "__gcc_qle"; 340 Names[RTLIB::OGT_F32] = "__gtsf2"; 341 Names[RTLIB::OGT_F64] = "__gtdf2"; 342 Names[RTLIB::OGT_F128] = "__gttf2"; 343 Names[RTLIB::OGT_PPCF128] = "__gcc_qgt"; 344 Names[RTLIB::UO_F32] = "__unordsf2"; 345 Names[RTLIB::UO_F64] = "__unorddf2"; 346 Names[RTLIB::UO_F128] = "__unordtf2"; 347 Names[RTLIB::UO_PPCF128] = "__gcc_qunord"; 348 Names[RTLIB::O_F32] = "__unordsf2"; 349 Names[RTLIB::O_F64] = "__unorddf2"; 350 Names[RTLIB::O_F128] = "__unordtf2"; 351 Names[RTLIB::O_PPCF128] = "__gcc_qunord"; 352 Names[RTLIB::MEMCPY] = "memcpy"; 353 Names[RTLIB::MEMMOVE] = "memmove"; 354 Names[RTLIB::MEMSET] = "memset"; 355 Names[RTLIB::UNWIND_RESUME] = "_Unwind_Resume"; 356 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1] = "__sync_val_compare_and_swap_1"; 357 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2] = "__sync_val_compare_and_swap_2"; 358 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4] = "__sync_val_compare_and_swap_4"; 359 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8] = "__sync_val_compare_and_swap_8"; 360 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_16] = "__sync_val_compare_and_swap_16"; 361 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_1] = "__sync_lock_test_and_set_1"; 362 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_2] = "__sync_lock_test_and_set_2"; 363 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_4] = "__sync_lock_test_and_set_4"; 364 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_8] = "__sync_lock_test_and_set_8"; 365 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_16] = "__sync_lock_test_and_set_16"; 366 Names[RTLIB::SYNC_FETCH_AND_ADD_1] = "__sync_fetch_and_add_1"; 367 Names[RTLIB::SYNC_FETCH_AND_ADD_2] = "__sync_fetch_and_add_2"; 368 Names[RTLIB::SYNC_FETCH_AND_ADD_4] = "__sync_fetch_and_add_4"; 369 Names[RTLIB::SYNC_FETCH_AND_ADD_8] = "__sync_fetch_and_add_8"; 370 Names[RTLIB::SYNC_FETCH_AND_ADD_16] = "__sync_fetch_and_add_16"; 371 Names[RTLIB::SYNC_FETCH_AND_SUB_1] = "__sync_fetch_and_sub_1"; 372 Names[RTLIB::SYNC_FETCH_AND_SUB_2] = "__sync_fetch_and_sub_2"; 373 Names[RTLIB::SYNC_FETCH_AND_SUB_4] = "__sync_fetch_and_sub_4"; 374 Names[RTLIB::SYNC_FETCH_AND_SUB_8] = "__sync_fetch_and_sub_8"; 375 Names[RTLIB::SYNC_FETCH_AND_SUB_16] = "__sync_fetch_and_sub_16"; 376 Names[RTLIB::SYNC_FETCH_AND_AND_1] = "__sync_fetch_and_and_1"; 377 Names[RTLIB::SYNC_FETCH_AND_AND_2] = "__sync_fetch_and_and_2"; 378 Names[RTLIB::SYNC_FETCH_AND_AND_4] = "__sync_fetch_and_and_4"; 379 Names[RTLIB::SYNC_FETCH_AND_AND_8] = "__sync_fetch_and_and_8"; 380 Names[RTLIB::SYNC_FETCH_AND_AND_16] = "__sync_fetch_and_and_16"; 381 Names[RTLIB::SYNC_FETCH_AND_OR_1] = "__sync_fetch_and_or_1"; 382 Names[RTLIB::SYNC_FETCH_AND_OR_2] = "__sync_fetch_and_or_2"; 383 Names[RTLIB::SYNC_FETCH_AND_OR_4] = "__sync_fetch_and_or_4"; 384 Names[RTLIB::SYNC_FETCH_AND_OR_8] = "__sync_fetch_and_or_8"; 385 Names[RTLIB::SYNC_FETCH_AND_OR_16] = "__sync_fetch_and_or_16"; 386 Names[RTLIB::SYNC_FETCH_AND_XOR_1] = "__sync_fetch_and_xor_1"; 387 Names[RTLIB::SYNC_FETCH_AND_XOR_2] = "__sync_fetch_and_xor_2"; 388 Names[RTLIB::SYNC_FETCH_AND_XOR_4] = "__sync_fetch_and_xor_4"; 389 Names[RTLIB::SYNC_FETCH_AND_XOR_8] = "__sync_fetch_and_xor_8"; 390 Names[RTLIB::SYNC_FETCH_AND_XOR_16] = "__sync_fetch_and_xor_16"; 391 Names[RTLIB::SYNC_FETCH_AND_NAND_1] = "__sync_fetch_and_nand_1"; 392 Names[RTLIB::SYNC_FETCH_AND_NAND_2] = "__sync_fetch_and_nand_2"; 393 Names[RTLIB::SYNC_FETCH_AND_NAND_4] = "__sync_fetch_and_nand_4"; 394 Names[RTLIB::SYNC_FETCH_AND_NAND_8] = "__sync_fetch_and_nand_8"; 395 Names[RTLIB::SYNC_FETCH_AND_NAND_16] = "__sync_fetch_and_nand_16"; 396 Names[RTLIB::SYNC_FETCH_AND_MAX_1] = "__sync_fetch_and_max_1"; 397 Names[RTLIB::SYNC_FETCH_AND_MAX_2] = "__sync_fetch_and_max_2"; 398 Names[RTLIB::SYNC_FETCH_AND_MAX_4] = "__sync_fetch_and_max_4"; 399 Names[RTLIB::SYNC_FETCH_AND_MAX_8] = "__sync_fetch_and_max_8"; 400 Names[RTLIB::SYNC_FETCH_AND_MAX_16] = "__sync_fetch_and_max_16"; 401 Names[RTLIB::SYNC_FETCH_AND_UMAX_1] = "__sync_fetch_and_umax_1"; 402 Names[RTLIB::SYNC_FETCH_AND_UMAX_2] = "__sync_fetch_and_umax_2"; 403 Names[RTLIB::SYNC_FETCH_AND_UMAX_4] = "__sync_fetch_and_umax_4"; 404 Names[RTLIB::SYNC_FETCH_AND_UMAX_8] = "__sync_fetch_and_umax_8"; 405 Names[RTLIB::SYNC_FETCH_AND_UMAX_16] = "__sync_fetch_and_umax_16"; 406 Names[RTLIB::SYNC_FETCH_AND_MIN_1] = "__sync_fetch_and_min_1"; 407 Names[RTLIB::SYNC_FETCH_AND_MIN_2] = "__sync_fetch_and_min_2"; 408 Names[RTLIB::SYNC_FETCH_AND_MIN_4] = "__sync_fetch_and_min_4"; 409 Names[RTLIB::SYNC_FETCH_AND_MIN_8] = "__sync_fetch_and_min_8"; 410 Names[RTLIB::SYNC_FETCH_AND_MIN_16] = "__sync_fetch_and_min_16"; 411 Names[RTLIB::SYNC_FETCH_AND_UMIN_1] = "__sync_fetch_and_umin_1"; 412 Names[RTLIB::SYNC_FETCH_AND_UMIN_2] = "__sync_fetch_and_umin_2"; 413 Names[RTLIB::SYNC_FETCH_AND_UMIN_4] = "__sync_fetch_and_umin_4"; 414 Names[RTLIB::SYNC_FETCH_AND_UMIN_8] = "__sync_fetch_and_umin_8"; 415 Names[RTLIB::SYNC_FETCH_AND_UMIN_16] = "__sync_fetch_and_umin_16"; 416 417 Names[RTLIB::ATOMIC_LOAD] = "__atomic_load"; 418 Names[RTLIB::ATOMIC_LOAD_1] = "__atomic_load_1"; 419 Names[RTLIB::ATOMIC_LOAD_2] = "__atomic_load_2"; 420 Names[RTLIB::ATOMIC_LOAD_4] = "__atomic_load_4"; 421 Names[RTLIB::ATOMIC_LOAD_8] = "__atomic_load_8"; 422 Names[RTLIB::ATOMIC_LOAD_16] = "__atomic_load_16"; 423 424 Names[RTLIB::ATOMIC_STORE] = "__atomic_store"; 425 Names[RTLIB::ATOMIC_STORE_1] = "__atomic_store_1"; 426 Names[RTLIB::ATOMIC_STORE_2] = "__atomic_store_2"; 427 Names[RTLIB::ATOMIC_STORE_4] = "__atomic_store_4"; 428 Names[RTLIB::ATOMIC_STORE_8] = "__atomic_store_8"; 429 Names[RTLIB::ATOMIC_STORE_16] = "__atomic_store_16"; 430 431 Names[RTLIB::ATOMIC_EXCHANGE] = "__atomic_exchange"; 432 Names[RTLIB::ATOMIC_EXCHANGE_1] = "__atomic_exchange_1"; 433 Names[RTLIB::ATOMIC_EXCHANGE_2] = "__atomic_exchange_2"; 434 Names[RTLIB::ATOMIC_EXCHANGE_4] = "__atomic_exchange_4"; 435 Names[RTLIB::ATOMIC_EXCHANGE_8] = "__atomic_exchange_8"; 436 Names[RTLIB::ATOMIC_EXCHANGE_16] = "__atomic_exchange_16"; 437 438 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE] = "__atomic_compare_exchange"; 439 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE_1] = "__atomic_compare_exchange_1"; 440 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE_2] = "__atomic_compare_exchange_2"; 441 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE_4] = "__atomic_compare_exchange_4"; 442 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE_8] = "__atomic_compare_exchange_8"; 443 Names[RTLIB::ATOMIC_COMPARE_EXCHANGE_16] = "__atomic_compare_exchange_16"; 444 445 Names[RTLIB::ATOMIC_FETCH_ADD_1] = "__atomic_fetch_add_1"; 446 Names[RTLIB::ATOMIC_FETCH_ADD_2] = "__atomic_fetch_add_2"; 447 Names[RTLIB::ATOMIC_FETCH_ADD_4] = "__atomic_fetch_add_4"; 448 Names[RTLIB::ATOMIC_FETCH_ADD_8] = "__atomic_fetch_add_8"; 449 Names[RTLIB::ATOMIC_FETCH_ADD_16] = "__atomic_fetch_add_16"; 450 Names[RTLIB::ATOMIC_FETCH_SUB_1] = "__atomic_fetch_sub_1"; 451 Names[RTLIB::ATOMIC_FETCH_SUB_2] = "__atomic_fetch_sub_2"; 452 Names[RTLIB::ATOMIC_FETCH_SUB_4] = "__atomic_fetch_sub_4"; 453 Names[RTLIB::ATOMIC_FETCH_SUB_8] = "__atomic_fetch_sub_8"; 454 Names[RTLIB::ATOMIC_FETCH_SUB_16] = "__atomic_fetch_sub_16"; 455 Names[RTLIB::ATOMIC_FETCH_AND_1] = "__atomic_fetch_and_1"; 456 Names[RTLIB::ATOMIC_FETCH_AND_2] = "__atomic_fetch_and_2"; 457 Names[RTLIB::ATOMIC_FETCH_AND_4] = "__atomic_fetch_and_4"; 458 Names[RTLIB::ATOMIC_FETCH_AND_8] = "__atomic_fetch_and_8"; 459 Names[RTLIB::ATOMIC_FETCH_AND_16] = "__atomic_fetch_and_16"; 460 Names[RTLIB::ATOMIC_FETCH_OR_1] = "__atomic_fetch_or_1"; 461 Names[RTLIB::ATOMIC_FETCH_OR_2] = "__atomic_fetch_or_2"; 462 Names[RTLIB::ATOMIC_FETCH_OR_4] = "__atomic_fetch_or_4"; 463 Names[RTLIB::ATOMIC_FETCH_OR_8] = "__atomic_fetch_or_8"; 464 Names[RTLIB::ATOMIC_FETCH_OR_16] = "__atomic_fetch_or_16"; 465 Names[RTLIB::ATOMIC_FETCH_XOR_1] = "__atomic_fetch_xor_1"; 466 Names[RTLIB::ATOMIC_FETCH_XOR_2] = "__atomic_fetch_xor_2"; 467 Names[RTLIB::ATOMIC_FETCH_XOR_4] = "__atomic_fetch_xor_4"; 468 Names[RTLIB::ATOMIC_FETCH_XOR_8] = "__atomic_fetch_xor_8"; 469 Names[RTLIB::ATOMIC_FETCH_XOR_16] = "__atomic_fetch_xor_16"; 470 Names[RTLIB::ATOMIC_FETCH_NAND_1] = "__atomic_fetch_nand_1"; 471 Names[RTLIB::ATOMIC_FETCH_NAND_2] = "__atomic_fetch_nand_2"; 472 Names[RTLIB::ATOMIC_FETCH_NAND_4] = "__atomic_fetch_nand_4"; 473 Names[RTLIB::ATOMIC_FETCH_NAND_8] = "__atomic_fetch_nand_8"; 474 Names[RTLIB::ATOMIC_FETCH_NAND_16] = "__atomic_fetch_nand_16"; 475 476 if (TT.isGNUEnvironment()) { 477 Names[RTLIB::SINCOS_F32] = "sincosf"; 478 Names[RTLIB::SINCOS_F64] = "sincos"; 479 Names[RTLIB::SINCOS_F80] = "sincosl"; 480 Names[RTLIB::SINCOS_F128] = "sincosl"; 481 Names[RTLIB::SINCOS_PPCF128] = "sincosl"; 482 } 483 484 if (!TT.isOSOpenBSD()) { 485 Names[RTLIB::STACKPROTECTOR_CHECK_FAIL] = "__stack_chk_fail"; 486 } 487 488 Names[RTLIB::DEOPTIMIZE] = "__llvm_deoptimize"; 489 } 490 491 /// InitLibcallCallingConvs - Set default libcall CallingConvs. 492 /// 493 static void InitLibcallCallingConvs(CallingConv::ID *CCs) { 494 for (int i = 0; i < RTLIB::UNKNOWN_LIBCALL; ++i) { 495 CCs[i] = CallingConv::C; 496 } 497 } 498 499 /// getFPEXT - Return the FPEXT_*_* value for the given types, or 500 /// UNKNOWN_LIBCALL if there is none. 501 RTLIB::Libcall RTLIB::getFPEXT(EVT OpVT, EVT RetVT) { 502 if (OpVT == MVT::f16) { 503 if (RetVT == MVT::f32) 504 return FPEXT_F16_F32; 505 } else if (OpVT == MVT::f32) { 506 if (RetVT == MVT::f64) 507 return FPEXT_F32_F64; 508 if (RetVT == MVT::f128) 509 return FPEXT_F32_F128; 510 if (RetVT == MVT::ppcf128) 511 return FPEXT_F32_PPCF128; 512 } else if (OpVT == MVT::f64) { 513 if (RetVT == MVT::f128) 514 return FPEXT_F64_F128; 515 else if (RetVT == MVT::ppcf128) 516 return FPEXT_F64_PPCF128; 517 } 518 519 return UNKNOWN_LIBCALL; 520 } 521 522 /// getFPROUND - Return the FPROUND_*_* value for the given types, or 523 /// UNKNOWN_LIBCALL if there is none. 524 RTLIB::Libcall RTLIB::getFPROUND(EVT OpVT, EVT RetVT) { 525 if (RetVT == MVT::f16) { 526 if (OpVT == MVT::f32) 527 return FPROUND_F32_F16; 528 if (OpVT == MVT::f64) 529 return FPROUND_F64_F16; 530 if (OpVT == MVT::f80) 531 return FPROUND_F80_F16; 532 if (OpVT == MVT::f128) 533 return FPROUND_F128_F16; 534 if (OpVT == MVT::ppcf128) 535 return FPROUND_PPCF128_F16; 536 } else if (RetVT == MVT::f32) { 537 if (OpVT == MVT::f64) 538 return FPROUND_F64_F32; 539 if (OpVT == MVT::f80) 540 return FPROUND_F80_F32; 541 if (OpVT == MVT::f128) 542 return FPROUND_F128_F32; 543 if (OpVT == MVT::ppcf128) 544 return FPROUND_PPCF128_F32; 545 } else if (RetVT == MVT::f64) { 546 if (OpVT == MVT::f80) 547 return FPROUND_F80_F64; 548 if (OpVT == MVT::f128) 549 return FPROUND_F128_F64; 550 if (OpVT == MVT::ppcf128) 551 return FPROUND_PPCF128_F64; 552 } 553 554 return UNKNOWN_LIBCALL; 555 } 556 557 /// getFPTOSINT - Return the FPTOSINT_*_* value for the given types, or 558 /// UNKNOWN_LIBCALL if there is none. 559 RTLIB::Libcall RTLIB::getFPTOSINT(EVT OpVT, EVT RetVT) { 560 if (OpVT == MVT::f32) { 561 if (RetVT == MVT::i32) 562 return FPTOSINT_F32_I32; 563 if (RetVT == MVT::i64) 564 return FPTOSINT_F32_I64; 565 if (RetVT == MVT::i128) 566 return FPTOSINT_F32_I128; 567 } else if (OpVT == MVT::f64) { 568 if (RetVT == MVT::i32) 569 return FPTOSINT_F64_I32; 570 if (RetVT == MVT::i64) 571 return FPTOSINT_F64_I64; 572 if (RetVT == MVT::i128) 573 return FPTOSINT_F64_I128; 574 } else if (OpVT == MVT::f80) { 575 if (RetVT == MVT::i32) 576 return FPTOSINT_F80_I32; 577 if (RetVT == MVT::i64) 578 return FPTOSINT_F80_I64; 579 if (RetVT == MVT::i128) 580 return FPTOSINT_F80_I128; 581 } else if (OpVT == MVT::f128) { 582 if (RetVT == MVT::i32) 583 return FPTOSINT_F128_I32; 584 if (RetVT == MVT::i64) 585 return FPTOSINT_F128_I64; 586 if (RetVT == MVT::i128) 587 return FPTOSINT_F128_I128; 588 } else if (OpVT == MVT::ppcf128) { 589 if (RetVT == MVT::i32) 590 return FPTOSINT_PPCF128_I32; 591 if (RetVT == MVT::i64) 592 return FPTOSINT_PPCF128_I64; 593 if (RetVT == MVT::i128) 594 return FPTOSINT_PPCF128_I128; 595 } 596 return UNKNOWN_LIBCALL; 597 } 598 599 /// getFPTOUINT - Return the FPTOUINT_*_* value for the given types, or 600 /// UNKNOWN_LIBCALL if there is none. 601 RTLIB::Libcall RTLIB::getFPTOUINT(EVT OpVT, EVT RetVT) { 602 if (OpVT == MVT::f32) { 603 if (RetVT == MVT::i32) 604 return FPTOUINT_F32_I32; 605 if (RetVT == MVT::i64) 606 return FPTOUINT_F32_I64; 607 if (RetVT == MVT::i128) 608 return FPTOUINT_F32_I128; 609 } else if (OpVT == MVT::f64) { 610 if (RetVT == MVT::i32) 611 return FPTOUINT_F64_I32; 612 if (RetVT == MVT::i64) 613 return FPTOUINT_F64_I64; 614 if (RetVT == MVT::i128) 615 return FPTOUINT_F64_I128; 616 } else if (OpVT == MVT::f80) { 617 if (RetVT == MVT::i32) 618 return FPTOUINT_F80_I32; 619 if (RetVT == MVT::i64) 620 return FPTOUINT_F80_I64; 621 if (RetVT == MVT::i128) 622 return FPTOUINT_F80_I128; 623 } else if (OpVT == MVT::f128) { 624 if (RetVT == MVT::i32) 625 return FPTOUINT_F128_I32; 626 if (RetVT == MVT::i64) 627 return FPTOUINT_F128_I64; 628 if (RetVT == MVT::i128) 629 return FPTOUINT_F128_I128; 630 } else if (OpVT == MVT::ppcf128) { 631 if (RetVT == MVT::i32) 632 return FPTOUINT_PPCF128_I32; 633 if (RetVT == MVT::i64) 634 return FPTOUINT_PPCF128_I64; 635 if (RetVT == MVT::i128) 636 return FPTOUINT_PPCF128_I128; 637 } 638 return UNKNOWN_LIBCALL; 639 } 640 641 /// getSINTTOFP - Return the SINTTOFP_*_* value for the given types, or 642 /// UNKNOWN_LIBCALL if there is none. 643 RTLIB::Libcall RTLIB::getSINTTOFP(EVT OpVT, EVT RetVT) { 644 if (OpVT == MVT::i32) { 645 if (RetVT == MVT::f32) 646 return SINTTOFP_I32_F32; 647 if (RetVT == MVT::f64) 648 return SINTTOFP_I32_F64; 649 if (RetVT == MVT::f80) 650 return SINTTOFP_I32_F80; 651 if (RetVT == MVT::f128) 652 return SINTTOFP_I32_F128; 653 if (RetVT == MVT::ppcf128) 654 return SINTTOFP_I32_PPCF128; 655 } else if (OpVT == MVT::i64) { 656 if (RetVT == MVT::f32) 657 return SINTTOFP_I64_F32; 658 if (RetVT == MVT::f64) 659 return SINTTOFP_I64_F64; 660 if (RetVT == MVT::f80) 661 return SINTTOFP_I64_F80; 662 if (RetVT == MVT::f128) 663 return SINTTOFP_I64_F128; 664 if (RetVT == MVT::ppcf128) 665 return SINTTOFP_I64_PPCF128; 666 } else if (OpVT == MVT::i128) { 667 if (RetVT == MVT::f32) 668 return SINTTOFP_I128_F32; 669 if (RetVT == MVT::f64) 670 return SINTTOFP_I128_F64; 671 if (RetVT == MVT::f80) 672 return SINTTOFP_I128_F80; 673 if (RetVT == MVT::f128) 674 return SINTTOFP_I128_F128; 675 if (RetVT == MVT::ppcf128) 676 return SINTTOFP_I128_PPCF128; 677 } 678 return UNKNOWN_LIBCALL; 679 } 680 681 /// getUINTTOFP - Return the UINTTOFP_*_* value for the given types, or 682 /// UNKNOWN_LIBCALL if there is none. 683 RTLIB::Libcall RTLIB::getUINTTOFP(EVT OpVT, EVT RetVT) { 684 if (OpVT == MVT::i32) { 685 if (RetVT == MVT::f32) 686 return UINTTOFP_I32_F32; 687 if (RetVT == MVT::f64) 688 return UINTTOFP_I32_F64; 689 if (RetVT == MVT::f80) 690 return UINTTOFP_I32_F80; 691 if (RetVT == MVT::f128) 692 return UINTTOFP_I32_F128; 693 if (RetVT == MVT::ppcf128) 694 return UINTTOFP_I32_PPCF128; 695 } else if (OpVT == MVT::i64) { 696 if (RetVT == MVT::f32) 697 return UINTTOFP_I64_F32; 698 if (RetVT == MVT::f64) 699 return UINTTOFP_I64_F64; 700 if (RetVT == MVT::f80) 701 return UINTTOFP_I64_F80; 702 if (RetVT == MVT::f128) 703 return UINTTOFP_I64_F128; 704 if (RetVT == MVT::ppcf128) 705 return UINTTOFP_I64_PPCF128; 706 } else if (OpVT == MVT::i128) { 707 if (RetVT == MVT::f32) 708 return UINTTOFP_I128_F32; 709 if (RetVT == MVT::f64) 710 return UINTTOFP_I128_F64; 711 if (RetVT == MVT::f80) 712 return UINTTOFP_I128_F80; 713 if (RetVT == MVT::f128) 714 return UINTTOFP_I128_F128; 715 if (RetVT == MVT::ppcf128) 716 return UINTTOFP_I128_PPCF128; 717 } 718 return UNKNOWN_LIBCALL; 719 } 720 721 RTLIB::Libcall RTLIB::getSYNC(unsigned Opc, MVT VT) { 722 #define OP_TO_LIBCALL(Name, Enum) \ 723 case Name: \ 724 switch (VT.SimpleTy) { \ 725 default: \ 726 return UNKNOWN_LIBCALL; \ 727 case MVT::i8: \ 728 return Enum##_1; \ 729 case MVT::i16: \ 730 return Enum##_2; \ 731 case MVT::i32: \ 732 return Enum##_4; \ 733 case MVT::i64: \ 734 return Enum##_8; \ 735 case MVT::i128: \ 736 return Enum##_16; \ 737 } 738 739 switch (Opc) { 740 OP_TO_LIBCALL(ISD::ATOMIC_SWAP, SYNC_LOCK_TEST_AND_SET) 741 OP_TO_LIBCALL(ISD::ATOMIC_CMP_SWAP, SYNC_VAL_COMPARE_AND_SWAP) 742 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_ADD, SYNC_FETCH_AND_ADD) 743 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_SUB, SYNC_FETCH_AND_SUB) 744 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_AND, SYNC_FETCH_AND_AND) 745 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_OR, SYNC_FETCH_AND_OR) 746 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_XOR, SYNC_FETCH_AND_XOR) 747 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_NAND, SYNC_FETCH_AND_NAND) 748 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_MAX, SYNC_FETCH_AND_MAX) 749 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_UMAX, SYNC_FETCH_AND_UMAX) 750 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_MIN, SYNC_FETCH_AND_MIN) 751 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_UMIN, SYNC_FETCH_AND_UMIN) 752 } 753 754 #undef OP_TO_LIBCALL 755 756 return UNKNOWN_LIBCALL; 757 } 758 759 /// InitCmpLibcallCCs - Set default comparison libcall CC. 760 /// 761 static void InitCmpLibcallCCs(ISD::CondCode *CCs) { 762 memset(CCs, ISD::SETCC_INVALID, sizeof(ISD::CondCode)*RTLIB::UNKNOWN_LIBCALL); 763 CCs[RTLIB::OEQ_F32] = ISD::SETEQ; 764 CCs[RTLIB::OEQ_F64] = ISD::SETEQ; 765 CCs[RTLIB::OEQ_F128] = ISD::SETEQ; 766 CCs[RTLIB::OEQ_PPCF128] = ISD::SETEQ; 767 CCs[RTLIB::UNE_F32] = ISD::SETNE; 768 CCs[RTLIB::UNE_F64] = ISD::SETNE; 769 CCs[RTLIB::UNE_F128] = ISD::SETNE; 770 CCs[RTLIB::UNE_PPCF128] = ISD::SETNE; 771 CCs[RTLIB::OGE_F32] = ISD::SETGE; 772 CCs[RTLIB::OGE_F64] = ISD::SETGE; 773 CCs[RTLIB::OGE_F128] = ISD::SETGE; 774 CCs[RTLIB::OGE_PPCF128] = ISD::SETGE; 775 CCs[RTLIB::OLT_F32] = ISD::SETLT; 776 CCs[RTLIB::OLT_F64] = ISD::SETLT; 777 CCs[RTLIB::OLT_F128] = ISD::SETLT; 778 CCs[RTLIB::OLT_PPCF128] = ISD::SETLT; 779 CCs[RTLIB::OLE_F32] = ISD::SETLE; 780 CCs[RTLIB::OLE_F64] = ISD::SETLE; 781 CCs[RTLIB::OLE_F128] = ISD::SETLE; 782 CCs[RTLIB::OLE_PPCF128] = ISD::SETLE; 783 CCs[RTLIB::OGT_F32] = ISD::SETGT; 784 CCs[RTLIB::OGT_F64] = ISD::SETGT; 785 CCs[RTLIB::OGT_F128] = ISD::SETGT; 786 CCs[RTLIB::OGT_PPCF128] = ISD::SETGT; 787 CCs[RTLIB::UO_F32] = ISD::SETNE; 788 CCs[RTLIB::UO_F64] = ISD::SETNE; 789 CCs[RTLIB::UO_F128] = ISD::SETNE; 790 CCs[RTLIB::UO_PPCF128] = ISD::SETNE; 791 CCs[RTLIB::O_F32] = ISD::SETEQ; 792 CCs[RTLIB::O_F64] = ISD::SETEQ; 793 CCs[RTLIB::O_F128] = ISD::SETEQ; 794 CCs[RTLIB::O_PPCF128] = ISD::SETEQ; 795 } 796 797 /// NOTE: The TargetMachine owns TLOF. 798 TargetLoweringBase::TargetLoweringBase(const TargetMachine &tm) : TM(tm) { 799 initActions(); 800 801 // Perform these initializations only once. 802 MaxStoresPerMemset = MaxStoresPerMemcpy = MaxStoresPerMemmove = 8; 803 MaxStoresPerMemsetOptSize = MaxStoresPerMemcpyOptSize 804 = MaxStoresPerMemmoveOptSize = 4; 805 UseUnderscoreSetJmp = false; 806 UseUnderscoreLongJmp = false; 807 SelectIsExpensive = false; 808 HasMultipleConditionRegisters = false; 809 HasExtractBitsInsn = false; 810 JumpIsExpensive = JumpIsExpensiveOverride; 811 PredictableSelectIsExpensive = false; 812 MaskAndBranchFoldingIsLegal = false; 813 EnableExtLdPromotion = false; 814 HasFloatingPointExceptions = true; 815 StackPointerRegisterToSaveRestore = 0; 816 BooleanContents = UndefinedBooleanContent; 817 BooleanFloatContents = UndefinedBooleanContent; 818 BooleanVectorContents = UndefinedBooleanContent; 819 SchedPreferenceInfo = Sched::ILP; 820 JumpBufSize = 0; 821 JumpBufAlignment = 0; 822 MinFunctionAlignment = 0; 823 PrefFunctionAlignment = 0; 824 PrefLoopAlignment = 0; 825 GatherAllAliasesMaxDepth = 6; 826 MinStackArgumentAlignment = 1; 827 MinimumJumpTableEntries = 4; 828 // TODO: the default will be switched to 0 in the next commit, along 829 // with the Target-specific changes necessary. 830 MaxAtomicSizeInBitsSupported = 1024; 831 832 MinCmpXchgSizeInBits = 0; 833 834 std::fill(std::begin(LibcallRoutineNames), std::end(LibcallRoutineNames), nullptr); 835 836 InitLibcallNames(LibcallRoutineNames, TM.getTargetTriple()); 837 InitCmpLibcallCCs(CmpLibcallCCs); 838 InitLibcallCallingConvs(LibcallCallingConvs); 839 } 840 841 void TargetLoweringBase::initActions() { 842 // All operations default to being supported. 843 memset(OpActions, 0, sizeof(OpActions)); 844 memset(LoadExtActions, 0, sizeof(LoadExtActions)); 845 memset(TruncStoreActions, 0, sizeof(TruncStoreActions)); 846 memset(IndexedModeActions, 0, sizeof(IndexedModeActions)); 847 memset(CondCodeActions, 0, sizeof(CondCodeActions)); 848 std::fill(std::begin(RegClassForVT), std::end(RegClassForVT), nullptr); 849 std::fill(std::begin(TargetDAGCombineArray), 850 std::end(TargetDAGCombineArray), 0); 851 852 // Set default actions for various operations. 853 for (MVT VT : MVT::all_valuetypes()) { 854 // Default all indexed load / store to expand. 855 for (unsigned IM = (unsigned)ISD::PRE_INC; 856 IM != (unsigned)ISD::LAST_INDEXED_MODE; ++IM) { 857 setIndexedLoadAction(IM, VT, Expand); 858 setIndexedStoreAction(IM, VT, Expand); 859 } 860 861 // Most backends expect to see the node which just returns the value loaded. 862 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Expand); 863 864 // These operations default to expand. 865 setOperationAction(ISD::FGETSIGN, VT, Expand); 866 setOperationAction(ISD::CONCAT_VECTORS, VT, Expand); 867 setOperationAction(ISD::FMINNUM, VT, Expand); 868 setOperationAction(ISD::FMAXNUM, VT, Expand); 869 setOperationAction(ISD::FMINNAN, VT, Expand); 870 setOperationAction(ISD::FMAXNAN, VT, Expand); 871 setOperationAction(ISD::FMAD, VT, Expand); 872 setOperationAction(ISD::SMIN, VT, Expand); 873 setOperationAction(ISD::SMAX, VT, Expand); 874 setOperationAction(ISD::UMIN, VT, Expand); 875 setOperationAction(ISD::UMAX, VT, Expand); 876 877 // Overflow operations default to expand 878 setOperationAction(ISD::SADDO, VT, Expand); 879 setOperationAction(ISD::SSUBO, VT, Expand); 880 setOperationAction(ISD::UADDO, VT, Expand); 881 setOperationAction(ISD::USUBO, VT, Expand); 882 setOperationAction(ISD::SMULO, VT, Expand); 883 setOperationAction(ISD::UMULO, VT, Expand); 884 885 // These default to Expand so they will be expanded to CTLZ/CTTZ by default. 886 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand); 887 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand); 888 889 setOperationAction(ISD::BITREVERSE, VT, Expand); 890 891 // These library functions default to expand. 892 setOperationAction(ISD::FROUND, VT, Expand); 893 894 // These operations default to expand for vector types. 895 if (VT.isVector()) { 896 setOperationAction(ISD::FCOPYSIGN, VT, Expand); 897 setOperationAction(ISD::ANY_EXTEND_VECTOR_INREG, VT, Expand); 898 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, VT, Expand); 899 setOperationAction(ISD::ZERO_EXTEND_VECTOR_INREG, VT, Expand); 900 } 901 902 // For most targets @llvm.get.dynamic.area.offset just returns 0. 903 setOperationAction(ISD::GET_DYNAMIC_AREA_OFFSET, VT, Expand); 904 } 905 906 // Most targets ignore the @llvm.prefetch intrinsic. 907 setOperationAction(ISD::PREFETCH, MVT::Other, Expand); 908 909 // Most targets also ignore the @llvm.readcyclecounter intrinsic. 910 setOperationAction(ISD::READCYCLECOUNTER, MVT::i64, Expand); 911 912 // ConstantFP nodes default to expand. Targets can either change this to 913 // Legal, in which case all fp constants are legal, or use isFPImmLegal() 914 // to optimize expansions for certain constants. 915 setOperationAction(ISD::ConstantFP, MVT::f16, Expand); 916 setOperationAction(ISD::ConstantFP, MVT::f32, Expand); 917 setOperationAction(ISD::ConstantFP, MVT::f64, Expand); 918 setOperationAction(ISD::ConstantFP, MVT::f80, Expand); 919 setOperationAction(ISD::ConstantFP, MVT::f128, Expand); 920 921 // These library functions default to expand. 922 for (MVT VT : {MVT::f32, MVT::f64, MVT::f128}) { 923 setOperationAction(ISD::FLOG , VT, Expand); 924 setOperationAction(ISD::FLOG2, VT, Expand); 925 setOperationAction(ISD::FLOG10, VT, Expand); 926 setOperationAction(ISD::FEXP , VT, Expand); 927 setOperationAction(ISD::FEXP2, VT, Expand); 928 setOperationAction(ISD::FFLOOR, VT, Expand); 929 setOperationAction(ISD::FNEARBYINT, VT, Expand); 930 setOperationAction(ISD::FCEIL, VT, Expand); 931 setOperationAction(ISD::FRINT, VT, Expand); 932 setOperationAction(ISD::FTRUNC, VT, Expand); 933 setOperationAction(ISD::FROUND, VT, Expand); 934 } 935 936 // Default ISD::TRAP to expand (which turns it into abort). 937 setOperationAction(ISD::TRAP, MVT::Other, Expand); 938 939 // On most systems, DEBUGTRAP and TRAP have no difference. The "Expand" 940 // here is to inform DAG Legalizer to replace DEBUGTRAP with TRAP. 941 // 942 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Expand); 943 } 944 945 MVT TargetLoweringBase::getScalarShiftAmountTy(const DataLayout &DL, 946 EVT) const { 947 return MVT::getIntegerVT(8 * DL.getPointerSize(0)); 948 } 949 950 EVT TargetLoweringBase::getShiftAmountTy(EVT LHSTy, 951 const DataLayout &DL) const { 952 assert(LHSTy.isInteger() && "Shift amount is not an integer type!"); 953 if (LHSTy.isVector()) 954 return LHSTy; 955 return getScalarShiftAmountTy(DL, LHSTy); 956 } 957 958 /// canOpTrap - Returns true if the operation can trap for the value type. 959 /// VT must be a legal type. 960 bool TargetLoweringBase::canOpTrap(unsigned Op, EVT VT) const { 961 assert(isTypeLegal(VT)); 962 switch (Op) { 963 default: 964 return false; 965 case ISD::FDIV: 966 case ISD::FREM: 967 case ISD::SDIV: 968 case ISD::UDIV: 969 case ISD::SREM: 970 case ISD::UREM: 971 return true; 972 } 973 } 974 975 void TargetLoweringBase::setJumpIsExpensive(bool isExpensive) { 976 // If the command-line option was specified, ignore this request. 977 if (!JumpIsExpensiveOverride.getNumOccurrences()) 978 JumpIsExpensive = isExpensive; 979 } 980 981 TargetLoweringBase::LegalizeKind 982 TargetLoweringBase::getTypeConversion(LLVMContext &Context, EVT VT) const { 983 // If this is a simple type, use the ComputeRegisterProp mechanism. 984 if (VT.isSimple()) { 985 MVT SVT = VT.getSimpleVT(); 986 assert((unsigned)SVT.SimpleTy < array_lengthof(TransformToType)); 987 MVT NVT = TransformToType[SVT.SimpleTy]; 988 LegalizeTypeAction LA = ValueTypeActions.getTypeAction(SVT); 989 990 assert((LA == TypeLegal || LA == TypeSoftenFloat || 991 ValueTypeActions.getTypeAction(NVT) != TypePromoteInteger) && 992 "Promote may not follow Expand or Promote"); 993 994 if (LA == TypeSplitVector) 995 return LegalizeKind(LA, 996 EVT::getVectorVT(Context, SVT.getVectorElementType(), 997 SVT.getVectorNumElements() / 2)); 998 if (LA == TypeScalarizeVector) 999 return LegalizeKind(LA, SVT.getVectorElementType()); 1000 return LegalizeKind(LA, NVT); 1001 } 1002 1003 // Handle Extended Scalar Types. 1004 if (!VT.isVector()) { 1005 assert(VT.isInteger() && "Float types must be simple"); 1006 unsigned BitSize = VT.getSizeInBits(); 1007 // First promote to a power-of-two size, then expand if necessary. 1008 if (BitSize < 8 || !isPowerOf2_32(BitSize)) { 1009 EVT NVT = VT.getRoundIntegerType(Context); 1010 assert(NVT != VT && "Unable to round integer VT"); 1011 LegalizeKind NextStep = getTypeConversion(Context, NVT); 1012 // Avoid multi-step promotion. 1013 if (NextStep.first == TypePromoteInteger) 1014 return NextStep; 1015 // Return rounded integer type. 1016 return LegalizeKind(TypePromoteInteger, NVT); 1017 } 1018 1019 return LegalizeKind(TypeExpandInteger, 1020 EVT::getIntegerVT(Context, VT.getSizeInBits() / 2)); 1021 } 1022 1023 // Handle vector types. 1024 unsigned NumElts = VT.getVectorNumElements(); 1025 EVT EltVT = VT.getVectorElementType(); 1026 1027 // Vectors with only one element are always scalarized. 1028 if (NumElts == 1) 1029 return LegalizeKind(TypeScalarizeVector, EltVT); 1030 1031 // Try to widen vector elements until the element type is a power of two and 1032 // promote it to a legal type later on, for example: 1033 // <3 x i8> -> <4 x i8> -> <4 x i32> 1034 if (EltVT.isInteger()) { 1035 // Vectors with a number of elements that is not a power of two are always 1036 // widened, for example <3 x i8> -> <4 x i8>. 1037 if (!VT.isPow2VectorType()) { 1038 NumElts = (unsigned)NextPowerOf2(NumElts); 1039 EVT NVT = EVT::getVectorVT(Context, EltVT, NumElts); 1040 return LegalizeKind(TypeWidenVector, NVT); 1041 } 1042 1043 // Examine the element type. 1044 LegalizeKind LK = getTypeConversion(Context, EltVT); 1045 1046 // If type is to be expanded, split the vector. 1047 // <4 x i140> -> <2 x i140> 1048 if (LK.first == TypeExpandInteger) 1049 return LegalizeKind(TypeSplitVector, 1050 EVT::getVectorVT(Context, EltVT, NumElts / 2)); 1051 1052 // Promote the integer element types until a legal vector type is found 1053 // or until the element integer type is too big. If a legal type was not 1054 // found, fallback to the usual mechanism of widening/splitting the 1055 // vector. 1056 EVT OldEltVT = EltVT; 1057 while (1) { 1058 // Increase the bitwidth of the element to the next pow-of-two 1059 // (which is greater than 8 bits). 1060 EltVT = EVT::getIntegerVT(Context, 1 + EltVT.getSizeInBits()) 1061 .getRoundIntegerType(Context); 1062 1063 // Stop trying when getting a non-simple element type. 1064 // Note that vector elements may be greater than legal vector element 1065 // types. Example: X86 XMM registers hold 64bit element on 32bit 1066 // systems. 1067 if (!EltVT.isSimple()) 1068 break; 1069 1070 // Build a new vector type and check if it is legal. 1071 MVT NVT = MVT::getVectorVT(EltVT.getSimpleVT(), NumElts); 1072 // Found a legal promoted vector type. 1073 if (NVT != MVT() && ValueTypeActions.getTypeAction(NVT) == TypeLegal) 1074 return LegalizeKind(TypePromoteInteger, 1075 EVT::getVectorVT(Context, EltVT, NumElts)); 1076 } 1077 1078 // Reset the type to the unexpanded type if we did not find a legal vector 1079 // type with a promoted vector element type. 1080 EltVT = OldEltVT; 1081 } 1082 1083 // Try to widen the vector until a legal type is found. 1084 // If there is no wider legal type, split the vector. 1085 while (1) { 1086 // Round up to the next power of 2. 1087 NumElts = (unsigned)NextPowerOf2(NumElts); 1088 1089 // If there is no simple vector type with this many elements then there 1090 // cannot be a larger legal vector type. Note that this assumes that 1091 // there are no skipped intermediate vector types in the simple types. 1092 if (!EltVT.isSimple()) 1093 break; 1094 MVT LargerVector = MVT::getVectorVT(EltVT.getSimpleVT(), NumElts); 1095 if (LargerVector == MVT()) 1096 break; 1097 1098 // If this type is legal then widen the vector. 1099 if (ValueTypeActions.getTypeAction(LargerVector) == TypeLegal) 1100 return LegalizeKind(TypeWidenVector, LargerVector); 1101 } 1102 1103 // Widen odd vectors to next power of two. 1104 if (!VT.isPow2VectorType()) { 1105 EVT NVT = VT.getPow2VectorType(Context); 1106 return LegalizeKind(TypeWidenVector, NVT); 1107 } 1108 1109 // Vectors with illegal element types are expanded. 1110 EVT NVT = EVT::getVectorVT(Context, EltVT, VT.getVectorNumElements() / 2); 1111 return LegalizeKind(TypeSplitVector, NVT); 1112 } 1113 1114 static unsigned getVectorTypeBreakdownMVT(MVT VT, MVT &IntermediateVT, 1115 unsigned &NumIntermediates, 1116 MVT &RegisterVT, 1117 TargetLoweringBase *TLI) { 1118 // Figure out the right, legal destination reg to copy into. 1119 unsigned NumElts = VT.getVectorNumElements(); 1120 MVT EltTy = VT.getVectorElementType(); 1121 1122 unsigned NumVectorRegs = 1; 1123 1124 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we 1125 // could break down into LHS/RHS like LegalizeDAG does. 1126 if (!isPowerOf2_32(NumElts)) { 1127 NumVectorRegs = NumElts; 1128 NumElts = 1; 1129 } 1130 1131 // Divide the input until we get to a supported size. This will always 1132 // end with a scalar if the target doesn't support vectors. 1133 while (NumElts > 1 && !TLI->isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) { 1134 NumElts >>= 1; 1135 NumVectorRegs <<= 1; 1136 } 1137 1138 NumIntermediates = NumVectorRegs; 1139 1140 MVT NewVT = MVT::getVectorVT(EltTy, NumElts); 1141 if (!TLI->isTypeLegal(NewVT)) 1142 NewVT = EltTy; 1143 IntermediateVT = NewVT; 1144 1145 unsigned NewVTSize = NewVT.getSizeInBits(); 1146 1147 // Convert sizes such as i33 to i64. 1148 if (!isPowerOf2_32(NewVTSize)) 1149 NewVTSize = NextPowerOf2(NewVTSize); 1150 1151 MVT DestVT = TLI->getRegisterType(NewVT); 1152 RegisterVT = DestVT; 1153 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16. 1154 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits()); 1155 1156 // Otherwise, promotion or legal types use the same number of registers as 1157 // the vector decimated to the appropriate level. 1158 return NumVectorRegs; 1159 } 1160 1161 /// isLegalRC - Return true if the value types that can be represented by the 1162 /// specified register class are all legal. 1163 bool TargetLoweringBase::isLegalRC(const TargetRegisterClass *RC) const { 1164 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 1165 I != E; ++I) { 1166 if (isTypeLegal(*I)) 1167 return true; 1168 } 1169 return false; 1170 } 1171 1172 /// Replace/modify any TargetFrameIndex operands with a targte-dependent 1173 /// sequence of memory operands that is recognized by PrologEpilogInserter. 1174 MachineBasicBlock * 1175 TargetLoweringBase::emitPatchPoint(MachineInstr &InitialMI, 1176 MachineBasicBlock *MBB) const { 1177 MachineInstr *MI = &InitialMI; 1178 MachineFunction &MF = *MI->getParent()->getParent(); 1179 MachineFrameInfo &MFI = MF.getFrameInfo(); 1180 1181 // We're handling multiple types of operands here: 1182 // PATCHPOINT MetaArgs - live-in, read only, direct 1183 // STATEPOINT Deopt Spill - live-through, read only, indirect 1184 // STATEPOINT Deopt Alloca - live-through, read only, direct 1185 // (We're currently conservative and mark the deopt slots read/write in 1186 // practice.) 1187 // STATEPOINT GC Spill - live-through, read/write, indirect 1188 // STATEPOINT GC Alloca - live-through, read/write, direct 1189 // The live-in vs live-through is handled already (the live through ones are 1190 // all stack slots), but we need to handle the different type of stackmap 1191 // operands and memory effects here. 1192 1193 // MI changes inside this loop as we grow operands. 1194 for(unsigned OperIdx = 0; OperIdx != MI->getNumOperands(); ++OperIdx) { 1195 MachineOperand &MO = MI->getOperand(OperIdx); 1196 if (!MO.isFI()) 1197 continue; 1198 1199 // foldMemoryOperand builds a new MI after replacing a single FI operand 1200 // with the canonical set of five x86 addressing-mode operands. 1201 int FI = MO.getIndex(); 1202 MachineInstrBuilder MIB = BuildMI(MF, MI->getDebugLoc(), MI->getDesc()); 1203 1204 // Copy operands before the frame-index. 1205 for (unsigned i = 0; i < OperIdx; ++i) 1206 MIB.addOperand(MI->getOperand(i)); 1207 // Add frame index operands recognized by stackmaps.cpp 1208 if (MFI.isStatepointSpillSlotObjectIndex(FI)) { 1209 // indirect-mem-ref tag, size, #FI, offset. 1210 // Used for spills inserted by StatepointLowering. This codepath is not 1211 // used for patchpoints/stackmaps at all, for these spilling is done via 1212 // foldMemoryOperand callback only. 1213 assert(MI->getOpcode() == TargetOpcode::STATEPOINT && "sanity"); 1214 MIB.addImm(StackMaps::IndirectMemRefOp); 1215 MIB.addImm(MFI.getObjectSize(FI)); 1216 MIB.addOperand(MI->getOperand(OperIdx)); 1217 MIB.addImm(0); 1218 } else { 1219 // direct-mem-ref tag, #FI, offset. 1220 // Used by patchpoint, and direct alloca arguments to statepoints 1221 MIB.addImm(StackMaps::DirectMemRefOp); 1222 MIB.addOperand(MI->getOperand(OperIdx)); 1223 MIB.addImm(0); 1224 } 1225 // Copy the operands after the frame index. 1226 for (unsigned i = OperIdx + 1; i != MI->getNumOperands(); ++i) 1227 MIB.addOperand(MI->getOperand(i)); 1228 1229 // Inherit previous memory operands. 1230 MIB->setMemRefs(MI->memoperands_begin(), MI->memoperands_end()); 1231 assert(MIB->mayLoad() && "Folded a stackmap use to a non-load!"); 1232 1233 // Add a new memory operand for this FI. 1234 assert(MFI.getObjectOffset(FI) != -1); 1235 1236 auto Flags = MachineMemOperand::MOLoad; 1237 if (MI->getOpcode() == TargetOpcode::STATEPOINT) { 1238 Flags |= MachineMemOperand::MOStore; 1239 Flags |= MachineMemOperand::MOVolatile; 1240 } 1241 MachineMemOperand *MMO = MF.getMachineMemOperand( 1242 MachinePointerInfo::getFixedStack(MF, FI), Flags, 1243 MF.getDataLayout().getPointerSize(), MFI.getObjectAlignment(FI)); 1244 MIB->addMemOperand(MF, MMO); 1245 1246 // Replace the instruction and update the operand index. 1247 MBB->insert(MachineBasicBlock::iterator(MI), MIB); 1248 OperIdx += (MIB->getNumOperands() - MI->getNumOperands()) - 1; 1249 MI->eraseFromParent(); 1250 MI = MIB; 1251 } 1252 return MBB; 1253 } 1254 1255 /// findRepresentativeClass - Return the largest legal super-reg register class 1256 /// of the register class for the specified type and its associated "cost". 1257 // This function is in TargetLowering because it uses RegClassForVT which would 1258 // need to be moved to TargetRegisterInfo and would necessitate moving 1259 // isTypeLegal over as well - a massive change that would just require 1260 // TargetLowering having a TargetRegisterInfo class member that it would use. 1261 std::pair<const TargetRegisterClass *, uint8_t> 1262 TargetLoweringBase::findRepresentativeClass(const TargetRegisterInfo *TRI, 1263 MVT VT) const { 1264 const TargetRegisterClass *RC = RegClassForVT[VT.SimpleTy]; 1265 if (!RC) 1266 return std::make_pair(RC, 0); 1267 1268 // Compute the set of all super-register classes. 1269 BitVector SuperRegRC(TRI->getNumRegClasses()); 1270 for (SuperRegClassIterator RCI(RC, TRI); RCI.isValid(); ++RCI) 1271 SuperRegRC.setBitsInMask(RCI.getMask()); 1272 1273 // Find the first legal register class with the largest spill size. 1274 const TargetRegisterClass *BestRC = RC; 1275 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) { 1276 const TargetRegisterClass *SuperRC = TRI->getRegClass(i); 1277 // We want the largest possible spill size. 1278 if (SuperRC->getSize() <= BestRC->getSize()) 1279 continue; 1280 if (!isLegalRC(SuperRC)) 1281 continue; 1282 BestRC = SuperRC; 1283 } 1284 return std::make_pair(BestRC, 1); 1285 } 1286 1287 /// computeRegisterProperties - Once all of the register classes are added, 1288 /// this allows us to compute derived properties we expose. 1289 void TargetLoweringBase::computeRegisterProperties( 1290 const TargetRegisterInfo *TRI) { 1291 static_assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE, 1292 "Too many value types for ValueTypeActions to hold!"); 1293 1294 // Everything defaults to needing one register. 1295 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) { 1296 NumRegistersForVT[i] = 1; 1297 RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i; 1298 } 1299 // ...except isVoid, which doesn't need any registers. 1300 NumRegistersForVT[MVT::isVoid] = 0; 1301 1302 // Find the largest integer register class. 1303 unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE; 1304 for (; RegClassForVT[LargestIntReg] == nullptr; --LargestIntReg) 1305 assert(LargestIntReg != MVT::i1 && "No integer registers defined!"); 1306 1307 // Every integer value type larger than this largest register takes twice as 1308 // many registers to represent as the previous ValueType. 1309 for (unsigned ExpandedReg = LargestIntReg + 1; 1310 ExpandedReg <= MVT::LAST_INTEGER_VALUETYPE; ++ExpandedReg) { 1311 NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1]; 1312 RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg; 1313 TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1); 1314 ValueTypeActions.setTypeAction((MVT::SimpleValueType)ExpandedReg, 1315 TypeExpandInteger); 1316 } 1317 1318 // Inspect all of the ValueType's smaller than the largest integer 1319 // register to see which ones need promotion. 1320 unsigned LegalIntReg = LargestIntReg; 1321 for (unsigned IntReg = LargestIntReg - 1; 1322 IntReg >= (unsigned)MVT::i1; --IntReg) { 1323 MVT IVT = (MVT::SimpleValueType)IntReg; 1324 if (isTypeLegal(IVT)) { 1325 LegalIntReg = IntReg; 1326 } else { 1327 RegisterTypeForVT[IntReg] = TransformToType[IntReg] = 1328 (const MVT::SimpleValueType)LegalIntReg; 1329 ValueTypeActions.setTypeAction(IVT, TypePromoteInteger); 1330 } 1331 } 1332 1333 // ppcf128 type is really two f64's. 1334 if (!isTypeLegal(MVT::ppcf128)) { 1335 if (isTypeLegal(MVT::f64)) { 1336 NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64]; 1337 RegisterTypeForVT[MVT::ppcf128] = MVT::f64; 1338 TransformToType[MVT::ppcf128] = MVT::f64; 1339 ValueTypeActions.setTypeAction(MVT::ppcf128, TypeExpandFloat); 1340 } else { 1341 NumRegistersForVT[MVT::ppcf128] = NumRegistersForVT[MVT::i128]; 1342 RegisterTypeForVT[MVT::ppcf128] = RegisterTypeForVT[MVT::i128]; 1343 TransformToType[MVT::ppcf128] = MVT::i128; 1344 ValueTypeActions.setTypeAction(MVT::ppcf128, TypeSoftenFloat); 1345 } 1346 } 1347 1348 // Decide how to handle f128. If the target does not have native f128 support, 1349 // expand it to i128 and we will be generating soft float library calls. 1350 if (!isTypeLegal(MVT::f128)) { 1351 NumRegistersForVT[MVT::f128] = NumRegistersForVT[MVT::i128]; 1352 RegisterTypeForVT[MVT::f128] = RegisterTypeForVT[MVT::i128]; 1353 TransformToType[MVT::f128] = MVT::i128; 1354 ValueTypeActions.setTypeAction(MVT::f128, TypeSoftenFloat); 1355 } 1356 1357 // Decide how to handle f64. If the target does not have native f64 support, 1358 // expand it to i64 and we will be generating soft float library calls. 1359 if (!isTypeLegal(MVT::f64)) { 1360 NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64]; 1361 RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64]; 1362 TransformToType[MVT::f64] = MVT::i64; 1363 ValueTypeActions.setTypeAction(MVT::f64, TypeSoftenFloat); 1364 } 1365 1366 // Decide how to handle f32. If the target does not have native f32 support, 1367 // expand it to i32 and we will be generating soft float library calls. 1368 if (!isTypeLegal(MVT::f32)) { 1369 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32]; 1370 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32]; 1371 TransformToType[MVT::f32] = MVT::i32; 1372 ValueTypeActions.setTypeAction(MVT::f32, TypeSoftenFloat); 1373 } 1374 1375 // Decide how to handle f16. If the target does not have native f16 support, 1376 // promote it to f32, because there are no f16 library calls (except for 1377 // conversions). 1378 if (!isTypeLegal(MVT::f16)) { 1379 NumRegistersForVT[MVT::f16] = NumRegistersForVT[MVT::f32]; 1380 RegisterTypeForVT[MVT::f16] = RegisterTypeForVT[MVT::f32]; 1381 TransformToType[MVT::f16] = MVT::f32; 1382 ValueTypeActions.setTypeAction(MVT::f16, TypePromoteFloat); 1383 } 1384 1385 // Loop over all of the vector value types to see which need transformations. 1386 for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE; 1387 i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) { 1388 MVT VT = (MVT::SimpleValueType) i; 1389 if (isTypeLegal(VT)) 1390 continue; 1391 1392 MVT EltVT = VT.getVectorElementType(); 1393 unsigned NElts = VT.getVectorNumElements(); 1394 bool IsLegalWiderType = false; 1395 LegalizeTypeAction PreferredAction = getPreferredVectorAction(VT); 1396 switch (PreferredAction) { 1397 case TypePromoteInteger: { 1398 // Try to promote the elements of integer vectors. If no legal 1399 // promotion was found, fall through to the widen-vector method. 1400 for (unsigned nVT = i + 1; nVT <= MVT::LAST_INTEGER_VECTOR_VALUETYPE; ++nVT) { 1401 MVT SVT = (MVT::SimpleValueType) nVT; 1402 // Promote vectors of integers to vectors with the same number 1403 // of elements, with a wider element type. 1404 if (SVT.getVectorElementType().getSizeInBits() > EltVT.getSizeInBits() && 1405 SVT.getVectorNumElements() == NElts && isTypeLegal(SVT)) { 1406 TransformToType[i] = SVT; 1407 RegisterTypeForVT[i] = SVT; 1408 NumRegistersForVT[i] = 1; 1409 ValueTypeActions.setTypeAction(VT, TypePromoteInteger); 1410 IsLegalWiderType = true; 1411 break; 1412 } 1413 } 1414 if (IsLegalWiderType) 1415 break; 1416 } 1417 case TypeWidenVector: { 1418 // Try to widen the vector. 1419 for (unsigned nVT = i + 1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) { 1420 MVT SVT = (MVT::SimpleValueType) nVT; 1421 if (SVT.getVectorElementType() == EltVT 1422 && SVT.getVectorNumElements() > NElts && isTypeLegal(SVT)) { 1423 TransformToType[i] = SVT; 1424 RegisterTypeForVT[i] = SVT; 1425 NumRegistersForVT[i] = 1; 1426 ValueTypeActions.setTypeAction(VT, TypeWidenVector); 1427 IsLegalWiderType = true; 1428 break; 1429 } 1430 } 1431 if (IsLegalWiderType) 1432 break; 1433 } 1434 case TypeSplitVector: 1435 case TypeScalarizeVector: { 1436 MVT IntermediateVT; 1437 MVT RegisterVT; 1438 unsigned NumIntermediates; 1439 NumRegistersForVT[i] = getVectorTypeBreakdownMVT(VT, IntermediateVT, 1440 NumIntermediates, RegisterVT, this); 1441 RegisterTypeForVT[i] = RegisterVT; 1442 1443 MVT NVT = VT.getPow2VectorType(); 1444 if (NVT == VT) { 1445 // Type is already a power of 2. The default action is to split. 1446 TransformToType[i] = MVT::Other; 1447 if (PreferredAction == TypeScalarizeVector) 1448 ValueTypeActions.setTypeAction(VT, TypeScalarizeVector); 1449 else if (PreferredAction == TypeSplitVector) 1450 ValueTypeActions.setTypeAction(VT, TypeSplitVector); 1451 else 1452 // Set type action according to the number of elements. 1453 ValueTypeActions.setTypeAction(VT, NElts == 1 ? TypeScalarizeVector 1454 : TypeSplitVector); 1455 } else { 1456 TransformToType[i] = NVT; 1457 ValueTypeActions.setTypeAction(VT, TypeWidenVector); 1458 } 1459 break; 1460 } 1461 default: 1462 llvm_unreachable("Unknown vector legalization action!"); 1463 } 1464 } 1465 1466 // Determine the 'representative' register class for each value type. 1467 // An representative register class is the largest (meaning one which is 1468 // not a sub-register class / subreg register class) legal register class for 1469 // a group of value types. For example, on i386, i8, i16, and i32 1470 // representative would be GR32; while on x86_64 it's GR64. 1471 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) { 1472 const TargetRegisterClass* RRC; 1473 uint8_t Cost; 1474 std::tie(RRC, Cost) = findRepresentativeClass(TRI, (MVT::SimpleValueType)i); 1475 RepRegClassForVT[i] = RRC; 1476 RepRegClassCostForVT[i] = Cost; 1477 } 1478 } 1479 1480 EVT TargetLoweringBase::getSetCCResultType(const DataLayout &DL, LLVMContext &, 1481 EVT VT) const { 1482 assert(!VT.isVector() && "No default SetCC type for vectors!"); 1483 return getPointerTy(DL).SimpleTy; 1484 } 1485 1486 MVT::SimpleValueType TargetLoweringBase::getCmpLibcallReturnType() const { 1487 return MVT::i32; // return the default value 1488 } 1489 1490 /// getVectorTypeBreakdown - Vector types are broken down into some number of 1491 /// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32 1492 /// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack. 1493 /// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86. 1494 /// 1495 /// This method returns the number of registers needed, and the VT for each 1496 /// register. It also returns the VT and quantity of the intermediate values 1497 /// before they are promoted/expanded. 1498 /// 1499 unsigned TargetLoweringBase::getVectorTypeBreakdown(LLVMContext &Context, EVT VT, 1500 EVT &IntermediateVT, 1501 unsigned &NumIntermediates, 1502 MVT &RegisterVT) const { 1503 unsigned NumElts = VT.getVectorNumElements(); 1504 1505 // If there is a wider vector type with the same element type as this one, 1506 // or a promoted vector type that has the same number of elements which 1507 // are wider, then we should convert to that legal vector type. 1508 // This handles things like <2 x float> -> <4 x float> and 1509 // <4 x i1> -> <4 x i32>. 1510 LegalizeTypeAction TA = getTypeAction(Context, VT); 1511 if (NumElts != 1 && (TA == TypeWidenVector || TA == TypePromoteInteger)) { 1512 EVT RegisterEVT = getTypeToTransformTo(Context, VT); 1513 if (isTypeLegal(RegisterEVT)) { 1514 IntermediateVT = RegisterEVT; 1515 RegisterVT = RegisterEVT.getSimpleVT(); 1516 NumIntermediates = 1; 1517 return 1; 1518 } 1519 } 1520 1521 // Figure out the right, legal destination reg to copy into. 1522 EVT EltTy = VT.getVectorElementType(); 1523 1524 unsigned NumVectorRegs = 1; 1525 1526 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we 1527 // could break down into LHS/RHS like LegalizeDAG does. 1528 if (!isPowerOf2_32(NumElts)) { 1529 NumVectorRegs = NumElts; 1530 NumElts = 1; 1531 } 1532 1533 // Divide the input until we get to a supported size. This will always 1534 // end with a scalar if the target doesn't support vectors. 1535 while (NumElts > 1 && !isTypeLegal( 1536 EVT::getVectorVT(Context, EltTy, NumElts))) { 1537 NumElts >>= 1; 1538 NumVectorRegs <<= 1; 1539 } 1540 1541 NumIntermediates = NumVectorRegs; 1542 1543 EVT NewVT = EVT::getVectorVT(Context, EltTy, NumElts); 1544 if (!isTypeLegal(NewVT)) 1545 NewVT = EltTy; 1546 IntermediateVT = NewVT; 1547 1548 MVT DestVT = getRegisterType(Context, NewVT); 1549 RegisterVT = DestVT; 1550 unsigned NewVTSize = NewVT.getSizeInBits(); 1551 1552 // Convert sizes such as i33 to i64. 1553 if (!isPowerOf2_32(NewVTSize)) 1554 NewVTSize = NextPowerOf2(NewVTSize); 1555 1556 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16. 1557 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits()); 1558 1559 // Otherwise, promotion or legal types use the same number of registers as 1560 // the vector decimated to the appropriate level. 1561 return NumVectorRegs; 1562 } 1563 1564 /// Get the EVTs and ArgFlags collections that represent the legalized return 1565 /// type of the given function. This does not require a DAG or a return value, 1566 /// and is suitable for use before any DAGs for the function are constructed. 1567 /// TODO: Move this out of TargetLowering.cpp. 1568 void llvm::GetReturnInfo(Type *ReturnType, AttributeSet attr, 1569 SmallVectorImpl<ISD::OutputArg> &Outs, 1570 const TargetLowering &TLI, const DataLayout &DL) { 1571 SmallVector<EVT, 4> ValueVTs; 1572 ComputeValueVTs(TLI, DL, ReturnType, ValueVTs); 1573 unsigned NumValues = ValueVTs.size(); 1574 if (NumValues == 0) return; 1575 1576 for (unsigned j = 0, f = NumValues; j != f; ++j) { 1577 EVT VT = ValueVTs[j]; 1578 ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1579 1580 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt)) 1581 ExtendKind = ISD::SIGN_EXTEND; 1582 else if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt)) 1583 ExtendKind = ISD::ZERO_EXTEND; 1584 1585 // FIXME: C calling convention requires the return type to be promoted to 1586 // at least 32-bit. But this is not necessary for non-C calling 1587 // conventions. The frontend should mark functions whose return values 1588 // require promoting with signext or zeroext attributes. 1589 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) { 1590 MVT MinVT = TLI.getRegisterType(ReturnType->getContext(), MVT::i32); 1591 if (VT.bitsLT(MinVT)) 1592 VT = MinVT; 1593 } 1594 1595 unsigned NumParts = TLI.getNumRegisters(ReturnType->getContext(), VT); 1596 MVT PartVT = TLI.getRegisterType(ReturnType->getContext(), VT); 1597 1598 // 'inreg' on function refers to return value 1599 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy(); 1600 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::InReg)) 1601 Flags.setInReg(); 1602 1603 // Propagate extension type if any 1604 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt)) 1605 Flags.setSExt(); 1606 else if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt)) 1607 Flags.setZExt(); 1608 1609 for (unsigned i = 0; i < NumParts; ++i) 1610 Outs.push_back(ISD::OutputArg(Flags, PartVT, VT, /*isFixed=*/true, 0, 0)); 1611 } 1612 } 1613 1614 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate 1615 /// function arguments in the caller parameter area. This is the actual 1616 /// alignment, not its logarithm. 1617 unsigned TargetLoweringBase::getByValTypeAlignment(Type *Ty, 1618 const DataLayout &DL) const { 1619 return DL.getABITypeAlignment(Ty); 1620 } 1621 1622 bool TargetLoweringBase::allowsMemoryAccess(LLVMContext &Context, 1623 const DataLayout &DL, EVT VT, 1624 unsigned AddrSpace, 1625 unsigned Alignment, 1626 bool *Fast) const { 1627 // Check if the specified alignment is sufficient based on the data layout. 1628 // TODO: While using the data layout works in practice, a better solution 1629 // would be to implement this check directly (make this a virtual function). 1630 // For example, the ABI alignment may change based on software platform while 1631 // this function should only be affected by hardware implementation. 1632 Type *Ty = VT.getTypeForEVT(Context); 1633 if (Alignment >= DL.getABITypeAlignment(Ty)) { 1634 // Assume that an access that meets the ABI-specified alignment is fast. 1635 if (Fast != nullptr) 1636 *Fast = true; 1637 return true; 1638 } 1639 1640 // This is a misaligned access. 1641 return allowsMisalignedMemoryAccesses(VT, AddrSpace, Alignment, Fast); 1642 } 1643 1644 BranchProbability TargetLoweringBase::getPredictableBranchThreshold() const { 1645 return BranchProbability(MinPercentageForPredictableBranch, 100); 1646 } 1647 1648 //===----------------------------------------------------------------------===// 1649 // TargetTransformInfo Helpers 1650 //===----------------------------------------------------------------------===// 1651 1652 int TargetLoweringBase::InstructionOpcodeToISD(unsigned Opcode) const { 1653 enum InstructionOpcodes { 1654 #define HANDLE_INST(NUM, OPCODE, CLASS) OPCODE = NUM, 1655 #define LAST_OTHER_INST(NUM) InstructionOpcodesCount = NUM 1656 #include "llvm/IR/Instruction.def" 1657 }; 1658 switch (static_cast<InstructionOpcodes>(Opcode)) { 1659 case Ret: return 0; 1660 case Br: return 0; 1661 case Switch: return 0; 1662 case IndirectBr: return 0; 1663 case Invoke: return 0; 1664 case Resume: return 0; 1665 case Unreachable: return 0; 1666 case CleanupRet: return 0; 1667 case CatchRet: return 0; 1668 case CatchPad: return 0; 1669 case CatchSwitch: return 0; 1670 case CleanupPad: return 0; 1671 case Add: return ISD::ADD; 1672 case FAdd: return ISD::FADD; 1673 case Sub: return ISD::SUB; 1674 case FSub: return ISD::FSUB; 1675 case Mul: return ISD::MUL; 1676 case FMul: return ISD::FMUL; 1677 case UDiv: return ISD::UDIV; 1678 case SDiv: return ISD::SDIV; 1679 case FDiv: return ISD::FDIV; 1680 case URem: return ISD::UREM; 1681 case SRem: return ISD::SREM; 1682 case FRem: return ISD::FREM; 1683 case Shl: return ISD::SHL; 1684 case LShr: return ISD::SRL; 1685 case AShr: return ISD::SRA; 1686 case And: return ISD::AND; 1687 case Or: return ISD::OR; 1688 case Xor: return ISD::XOR; 1689 case Alloca: return 0; 1690 case Load: return ISD::LOAD; 1691 case Store: return ISD::STORE; 1692 case GetElementPtr: return 0; 1693 case Fence: return 0; 1694 case AtomicCmpXchg: return 0; 1695 case AtomicRMW: return 0; 1696 case Trunc: return ISD::TRUNCATE; 1697 case ZExt: return ISD::ZERO_EXTEND; 1698 case SExt: return ISD::SIGN_EXTEND; 1699 case FPToUI: return ISD::FP_TO_UINT; 1700 case FPToSI: return ISD::FP_TO_SINT; 1701 case UIToFP: return ISD::UINT_TO_FP; 1702 case SIToFP: return ISD::SINT_TO_FP; 1703 case FPTrunc: return ISD::FP_ROUND; 1704 case FPExt: return ISD::FP_EXTEND; 1705 case PtrToInt: return ISD::BITCAST; 1706 case IntToPtr: return ISD::BITCAST; 1707 case BitCast: return ISD::BITCAST; 1708 case AddrSpaceCast: return ISD::ADDRSPACECAST; 1709 case ICmp: return ISD::SETCC; 1710 case FCmp: return ISD::SETCC; 1711 case PHI: return 0; 1712 case Call: return 0; 1713 case Select: return ISD::SELECT; 1714 case UserOp1: return 0; 1715 case UserOp2: return 0; 1716 case VAArg: return 0; 1717 case ExtractElement: return ISD::EXTRACT_VECTOR_ELT; 1718 case InsertElement: return ISD::INSERT_VECTOR_ELT; 1719 case ShuffleVector: return ISD::VECTOR_SHUFFLE; 1720 case ExtractValue: return ISD::MERGE_VALUES; 1721 case InsertValue: return ISD::MERGE_VALUES; 1722 case LandingPad: return 0; 1723 } 1724 1725 llvm_unreachable("Unknown instruction type encountered!"); 1726 } 1727 1728 std::pair<int, MVT> 1729 TargetLoweringBase::getTypeLegalizationCost(const DataLayout &DL, 1730 Type *Ty) const { 1731 LLVMContext &C = Ty->getContext(); 1732 EVT MTy = getValueType(DL, Ty); 1733 1734 int Cost = 1; 1735 // We keep legalizing the type until we find a legal kind. We assume that 1736 // the only operation that costs anything is the split. After splitting 1737 // we need to handle two types. 1738 while (true) { 1739 LegalizeKind LK = getTypeConversion(C, MTy); 1740 1741 if (LK.first == TypeLegal) 1742 return std::make_pair(Cost, MTy.getSimpleVT()); 1743 1744 if (LK.first == TypeSplitVector || LK.first == TypeExpandInteger) 1745 Cost *= 2; 1746 1747 // Do not loop with f128 type. 1748 if (MTy == LK.second) 1749 return std::make_pair(Cost, MTy.getSimpleVT()); 1750 1751 // Keep legalizing the type. 1752 MTy = LK.second; 1753 } 1754 } 1755 1756 Value *TargetLoweringBase::getSafeStackPointerLocation(IRBuilder<> &IRB) const { 1757 if (!TM.getTargetTriple().isAndroid()) 1758 return nullptr; 1759 1760 // Android provides a libc function to retrieve the address of the current 1761 // thread's unsafe stack pointer. 1762 Module *M = IRB.GetInsertBlock()->getParent()->getParent(); 1763 Type *StackPtrTy = Type::getInt8PtrTy(M->getContext()); 1764 Value *Fn = M->getOrInsertFunction("__safestack_pointer_address", 1765 StackPtrTy->getPointerTo(0), nullptr); 1766 return IRB.CreateCall(Fn); 1767 } 1768 1769 //===----------------------------------------------------------------------===// 1770 // Loop Strength Reduction hooks 1771 //===----------------------------------------------------------------------===// 1772 1773 /// isLegalAddressingMode - Return true if the addressing mode represented 1774 /// by AM is legal for this target, for a load/store of the specified type. 1775 bool TargetLoweringBase::isLegalAddressingMode(const DataLayout &DL, 1776 const AddrMode &AM, Type *Ty, 1777 unsigned AS) const { 1778 // The default implementation of this implements a conservative RISCy, r+r and 1779 // r+i addr mode. 1780 1781 // Allows a sign-extended 16-bit immediate field. 1782 if (AM.BaseOffs <= -(1LL << 16) || AM.BaseOffs >= (1LL << 16)-1) 1783 return false; 1784 1785 // No global is ever allowed as a base. 1786 if (AM.BaseGV) 1787 return false; 1788 1789 // Only support r+r, 1790 switch (AM.Scale) { 1791 case 0: // "r+i" or just "i", depending on HasBaseReg. 1792 break; 1793 case 1: 1794 if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed. 1795 return false; 1796 // Otherwise we have r+r or r+i. 1797 break; 1798 case 2: 1799 if (AM.HasBaseReg || AM.BaseOffs) // 2*r+r or 2*r+i is not allowed. 1800 return false; 1801 // Allow 2*r as r+r. 1802 break; 1803 default: // Don't allow n * r 1804 return false; 1805 } 1806 1807 return true; 1808 } 1809 1810 //===----------------------------------------------------------------------===// 1811 // Stack Protector 1812 //===----------------------------------------------------------------------===// 1813 1814 // For OpenBSD return its special guard variable. Otherwise return nullptr, 1815 // so that SelectionDAG handle SSP. 1816 Value *TargetLoweringBase::getIRStackGuard(IRBuilder<> &IRB) const { 1817 if (getTargetMachine().getTargetTriple().isOSOpenBSD()) { 1818 Module &M = *IRB.GetInsertBlock()->getParent()->getParent(); 1819 PointerType *PtrTy = Type::getInt8PtrTy(M.getContext()); 1820 return M.getOrInsertGlobal("__guard_local", PtrTy); 1821 } 1822 return nullptr; 1823 } 1824 1825 // Currently only support "standard" __stack_chk_guard. 1826 // TODO: add LOAD_STACK_GUARD support. 1827 void TargetLoweringBase::insertSSPDeclarations(Module &M) const { 1828 M.getOrInsertGlobal("__stack_chk_guard", Type::getInt8PtrTy(M.getContext())); 1829 } 1830 1831 // Currently only support "standard" __stack_chk_guard. 1832 // TODO: add LOAD_STACK_GUARD support. 1833 Value *TargetLoweringBase::getSDagStackGuard(const Module &M) const { 1834 return M.getGlobalVariable("__stack_chk_guard", true); 1835 } 1836 1837 Value *TargetLoweringBase::getSSPStackGuardCheck(const Module &M) const { 1838 return nullptr; 1839 } 1840