Ulrich Weigand | 1f6666a | 2015-03-31 12:52:27 +0000 | [diff] [blame] | 1 | //===-- SystemZTargetTransformInfo.cpp - SystemZ-specific TTI -------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements a TargetTransformInfo analysis pass specific to the |
| 11 | // SystemZ target machine. It uses the target's detailed information to provide |
| 12 | // more precise answers to certain TTI queries, while letting the target |
| 13 | // independent and default TTI implementations handle the rest. |
| 14 | // |
| 15 | //===----------------------------------------------------------------------===// |
| 16 | |
| 17 | #include "SystemZTargetTransformInfo.h" |
| 18 | #include "llvm/Analysis/TargetTransformInfo.h" |
| 19 | #include "llvm/CodeGen/BasicTTIImpl.h" |
| 20 | #include "llvm/IR/IntrinsicInst.h" |
| 21 | #include "llvm/Support/Debug.h" |
| 22 | #include "llvm/Target/CostTable.h" |
| 23 | #include "llvm/Target/TargetLowering.h" |
| 24 | using namespace llvm; |
| 25 | |
| 26 | #define DEBUG_TYPE "systemztti" |
| 27 | |
| 28 | //===----------------------------------------------------------------------===// |
| 29 | // |
| 30 | // SystemZ cost model. |
| 31 | // |
| 32 | //===----------------------------------------------------------------------===// |
| 33 | |
| 34 | unsigned SystemZTTIImpl::getIntImmCost(const APInt &Imm, Type *Ty) { |
| 35 | assert(Ty->isIntegerTy()); |
| 36 | |
| 37 | unsigned BitSize = Ty->getPrimitiveSizeInBits(); |
| 38 | // There is no cost model for constants with a bit size of 0. Return TCC_Free |
| 39 | // here, so that constant hoisting will ignore this constant. |
| 40 | if (BitSize == 0) |
| 41 | return TTI::TCC_Free; |
| 42 | // No cost model for operations on integers larger than 64 bit implemented yet. |
| 43 | if (BitSize > 64) |
| 44 | return TTI::TCC_Free; |
| 45 | |
| 46 | if (Imm == 0) |
| 47 | return TTI::TCC_Free; |
| 48 | |
| 49 | if (Imm.getBitWidth() <= 64) { |
| 50 | // Constants loaded via lgfi. |
| 51 | if (isInt<32>(Imm.getSExtValue())) |
| 52 | return TTI::TCC_Basic; |
| 53 | // Constants loaded via llilf. |
| 54 | if (isUInt<32>(Imm.getZExtValue())) |
| 55 | return TTI::TCC_Basic; |
| 56 | // Constants loaded via llihf: |
| 57 | if ((Imm.getZExtValue() & 0xffffffff) == 0) |
| 58 | return TTI::TCC_Basic; |
| 59 | |
| 60 | return 2 * TTI::TCC_Basic; |
| 61 | } |
| 62 | |
| 63 | return 4 * TTI::TCC_Basic; |
| 64 | } |
| 65 | |
| 66 | unsigned SystemZTTIImpl::getIntImmCost(unsigned Opcode, unsigned Idx, |
| 67 | const APInt &Imm, Type *Ty) { |
| 68 | assert(Ty->isIntegerTy()); |
| 69 | |
| 70 | unsigned BitSize = Ty->getPrimitiveSizeInBits(); |
| 71 | // There is no cost model for constants with a bit size of 0. Return TCC_Free |
| 72 | // here, so that constant hoisting will ignore this constant. |
| 73 | if (BitSize == 0) |
| 74 | return TTI::TCC_Free; |
| 75 | // No cost model for operations on integers larger than 64 bit implemented yet. |
| 76 | if (BitSize > 64) |
| 77 | return TTI::TCC_Free; |
| 78 | |
| 79 | switch (Opcode) { |
| 80 | default: |
| 81 | return TTI::TCC_Free; |
| 82 | case Instruction::GetElementPtr: |
| 83 | // Always hoist the base address of a GetElementPtr. This prevents the |
| 84 | // creation of new constants for every base constant that gets constant |
| 85 | // folded with the offset. |
| 86 | if (Idx == 0) |
| 87 | return 2 * TTI::TCC_Basic; |
| 88 | return TTI::TCC_Free; |
| 89 | case Instruction::Store: |
| 90 | if (Idx == 0 && Imm.getBitWidth() <= 64) { |
| 91 | // Any 8-bit immediate store can by implemented via mvi. |
| 92 | if (BitSize == 8) |
| 93 | return TTI::TCC_Free; |
| 94 | // 16-bit immediate values can be stored via mvhhi/mvhi/mvghi. |
| 95 | if (isInt<16>(Imm.getSExtValue())) |
| 96 | return TTI::TCC_Free; |
| 97 | } |
| 98 | break; |
| 99 | case Instruction::ICmp: |
| 100 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 101 | // Comparisons against signed 32-bit immediates implemented via cgfi. |
| 102 | if (isInt<32>(Imm.getSExtValue())) |
| 103 | return TTI::TCC_Free; |
| 104 | // Comparisons against unsigned 32-bit immediates implemented via clgfi. |
| 105 | if (isUInt<32>(Imm.getZExtValue())) |
| 106 | return TTI::TCC_Free; |
| 107 | } |
| 108 | break; |
| 109 | case Instruction::Add: |
| 110 | case Instruction::Sub: |
| 111 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 112 | // We use algfi/slgfi to add/subtract 32-bit unsigned immediates. |
| 113 | if (isUInt<32>(Imm.getZExtValue())) |
| 114 | return TTI::TCC_Free; |
| 115 | // Or their negation, by swapping addition vs. subtraction. |
| 116 | if (isUInt<32>(-Imm.getSExtValue())) |
| 117 | return TTI::TCC_Free; |
| 118 | } |
| 119 | break; |
| 120 | case Instruction::Mul: |
| 121 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 122 | // We use msgfi to multiply by 32-bit signed immediates. |
| 123 | if (isInt<32>(Imm.getSExtValue())) |
| 124 | return TTI::TCC_Free; |
| 125 | } |
| 126 | break; |
| 127 | case Instruction::Or: |
| 128 | case Instruction::Xor: |
| 129 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 130 | // Masks supported by oilf/xilf. |
| 131 | if (isUInt<32>(Imm.getZExtValue())) |
| 132 | return TTI::TCC_Free; |
| 133 | // Masks supported by oihf/xihf. |
| 134 | if ((Imm.getZExtValue() & 0xffffffff) == 0) |
| 135 | return TTI::TCC_Free; |
| 136 | } |
| 137 | break; |
| 138 | case Instruction::And: |
| 139 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 140 | // Any 32-bit AND operation can by implemented via nilf. |
| 141 | if (BitSize <= 32) |
| 142 | return TTI::TCC_Free; |
| 143 | // 64-bit masks supported by nilf. |
| 144 | if (isUInt<32>(~Imm.getZExtValue())) |
| 145 | return TTI::TCC_Free; |
| 146 | // 64-bit masks supported by nilh. |
| 147 | if ((Imm.getZExtValue() & 0xffffffff) == 0xffffffff) |
| 148 | return TTI::TCC_Free; |
| 149 | // Some 64-bit AND operations can be implemented via risbg. |
| 150 | const SystemZInstrInfo *TII = ST->getInstrInfo(); |
| 151 | unsigned Start, End; |
| 152 | if (TII->isRxSBGMask(Imm.getZExtValue(), BitSize, Start, End)) |
| 153 | return TTI::TCC_Free; |
| 154 | } |
| 155 | break; |
| 156 | case Instruction::Shl: |
| 157 | case Instruction::LShr: |
| 158 | case Instruction::AShr: |
| 159 | // Always return TCC_Free for the shift value of a shift instruction. |
| 160 | if (Idx == 1) |
| 161 | return TTI::TCC_Free; |
| 162 | break; |
| 163 | case Instruction::UDiv: |
| 164 | case Instruction::SDiv: |
| 165 | case Instruction::URem: |
| 166 | case Instruction::SRem: |
| 167 | case Instruction::Trunc: |
| 168 | case Instruction::ZExt: |
| 169 | case Instruction::SExt: |
| 170 | case Instruction::IntToPtr: |
| 171 | case Instruction::PtrToInt: |
| 172 | case Instruction::BitCast: |
| 173 | case Instruction::PHI: |
| 174 | case Instruction::Call: |
| 175 | case Instruction::Select: |
| 176 | case Instruction::Ret: |
| 177 | case Instruction::Load: |
| 178 | break; |
| 179 | } |
| 180 | |
| 181 | return SystemZTTIImpl::getIntImmCost(Imm, Ty); |
| 182 | } |
| 183 | |
| 184 | unsigned SystemZTTIImpl::getIntImmCost(Intrinsic::ID IID, unsigned Idx, |
| 185 | const APInt &Imm, Type *Ty) { |
| 186 | assert(Ty->isIntegerTy()); |
| 187 | |
| 188 | unsigned BitSize = Ty->getPrimitiveSizeInBits(); |
| 189 | // There is no cost model for constants with a bit size of 0. Return TCC_Free |
| 190 | // here, so that constant hoisting will ignore this constant. |
| 191 | if (BitSize == 0) |
| 192 | return TTI::TCC_Free; |
| 193 | // No cost model for operations on integers larger than 64 bit implemented yet. |
| 194 | if (BitSize > 64) |
| 195 | return TTI::TCC_Free; |
| 196 | |
| 197 | switch (IID) { |
| 198 | default: |
| 199 | return TTI::TCC_Free; |
| 200 | case Intrinsic::sadd_with_overflow: |
| 201 | case Intrinsic::uadd_with_overflow: |
| 202 | case Intrinsic::ssub_with_overflow: |
| 203 | case Intrinsic::usub_with_overflow: |
| 204 | // These get expanded to include a normal addition/subtraction. |
| 205 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 206 | if (isUInt<32>(Imm.getZExtValue())) |
| 207 | return TTI::TCC_Free; |
| 208 | if (isUInt<32>(-Imm.getSExtValue())) |
| 209 | return TTI::TCC_Free; |
| 210 | } |
| 211 | break; |
| 212 | case Intrinsic::smul_with_overflow: |
| 213 | case Intrinsic::umul_with_overflow: |
| 214 | // These get expanded to include a normal multiplication. |
| 215 | if (Idx == 1 && Imm.getBitWidth() <= 64) { |
| 216 | if (isInt<32>(Imm.getSExtValue())) |
| 217 | return TTI::TCC_Free; |
| 218 | } |
| 219 | break; |
| 220 | case Intrinsic::experimental_stackmap: |
| 221 | if ((Idx < 2) || (Imm.getBitWidth() <= 64 && isInt<64>(Imm.getSExtValue()))) |
| 222 | return TTI::TCC_Free; |
| 223 | break; |
| 224 | case Intrinsic::experimental_patchpoint_void: |
| 225 | case Intrinsic::experimental_patchpoint_i64: |
| 226 | if ((Idx < 4) || (Imm.getBitWidth() <= 64 && isInt<64>(Imm.getSExtValue()))) |
| 227 | return TTI::TCC_Free; |
| 228 | break; |
| 229 | } |
| 230 | return SystemZTTIImpl::getIntImmCost(Imm, Ty); |
| 231 | } |
Ulrich Weigand | b401218 | 2015-03-31 12:56:33 +0000 | [diff] [blame] | 232 | |
| 233 | TargetTransformInfo::PopcntSupportKind |
| 234 | SystemZTTIImpl::getPopcntSupport(unsigned TyWidth) { |
| 235 | assert(isPowerOf2_32(TyWidth) && "Type width must be power of 2"); |
| 236 | if (ST->hasPopulationCount() && TyWidth <= 64) |
| 237 | return TTI::PSK_FastHardware; |
| 238 | return TTI::PSK_Software; |
| 239 | } |
| 240 | |
Ulrich Weigand | ce4c109 | 2015-05-05 19:25:42 +0000 | [diff] [blame^] | 241 | unsigned SystemZTTIImpl::getNumberOfRegisters(bool Vector) { |
| 242 | if (!Vector) |
| 243 | // Discount the stack pointer. Also leave out %r0, since it can't |
| 244 | // be used in an address. |
| 245 | return 14; |
| 246 | if (ST->hasVector()) |
| 247 | return 32; |
| 248 | return 0; |
| 249 | } |
| 250 | |
| 251 | unsigned SystemZTTIImpl::getRegisterBitWidth(bool Vector) { |
| 252 | if (!Vector) |
| 253 | return 64; |
| 254 | if (ST->hasVector()) |
| 255 | return 128; |
| 256 | return 0; |
| 257 | } |
| 258 | |