Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1 | //===-- HexagonISelLoweringHVX.cpp --- Lowering HVX operations ------------===// |
| 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 | #include "HexagonISelLowering.h" |
| 11 | #include "HexagonRegisterInfo.h" |
| 12 | #include "HexagonSubtarget.h" |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 13 | #include "llvm/Support/CommandLine.h" |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 14 | |
| 15 | using namespace llvm; |
| 16 | |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 17 | static const MVT LegalV64[] = { MVT::v64i8, MVT::v32i16, MVT::v16i32 }; |
| 18 | static const MVT LegalW64[] = { MVT::v128i8, MVT::v64i16, MVT::v32i32 }; |
| 19 | static const MVT LegalV128[] = { MVT::v128i8, MVT::v64i16, MVT::v32i32 }; |
| 20 | static const MVT LegalW128[] = { MVT::v256i8, MVT::v128i16, MVT::v64i32 }; |
| 21 | |
| 22 | |
| 23 | void |
| 24 | HexagonTargetLowering::initializeHVXLowering() { |
| 25 | if (Subtarget.useHVX64BOps()) { |
| 26 | addRegisterClass(MVT::v64i8, &Hexagon::HvxVRRegClass); |
| 27 | addRegisterClass(MVT::v32i16, &Hexagon::HvxVRRegClass); |
| 28 | addRegisterClass(MVT::v16i32, &Hexagon::HvxVRRegClass); |
| 29 | addRegisterClass(MVT::v128i8, &Hexagon::HvxWRRegClass); |
| 30 | addRegisterClass(MVT::v64i16, &Hexagon::HvxWRRegClass); |
| 31 | addRegisterClass(MVT::v32i32, &Hexagon::HvxWRRegClass); |
| 32 | // These "short" boolean vector types should be legal because |
| 33 | // they will appear as results of vector compares. If they were |
| 34 | // not legal, type legalization would try to make them legal |
| 35 | // and that would require using operations that do not use or |
| 36 | // produce such types. That, in turn, would imply using custom |
| 37 | // nodes, which would be unoptimizable by the DAG combiner. |
| 38 | // The idea is to rely on target-independent operations as much |
| 39 | // as possible. |
| 40 | addRegisterClass(MVT::v16i1, &Hexagon::HvxQRRegClass); |
| 41 | addRegisterClass(MVT::v32i1, &Hexagon::HvxQRRegClass); |
| 42 | addRegisterClass(MVT::v64i1, &Hexagon::HvxQRRegClass); |
| 43 | addRegisterClass(MVT::v512i1, &Hexagon::HvxQRRegClass); |
| 44 | } else if (Subtarget.useHVX128BOps()) { |
| 45 | addRegisterClass(MVT::v128i8, &Hexagon::HvxVRRegClass); |
| 46 | addRegisterClass(MVT::v64i16, &Hexagon::HvxVRRegClass); |
| 47 | addRegisterClass(MVT::v32i32, &Hexagon::HvxVRRegClass); |
| 48 | addRegisterClass(MVT::v256i8, &Hexagon::HvxWRRegClass); |
| 49 | addRegisterClass(MVT::v128i16, &Hexagon::HvxWRRegClass); |
| 50 | addRegisterClass(MVT::v64i32, &Hexagon::HvxWRRegClass); |
| 51 | addRegisterClass(MVT::v32i1, &Hexagon::HvxQRRegClass); |
| 52 | addRegisterClass(MVT::v64i1, &Hexagon::HvxQRRegClass); |
| 53 | addRegisterClass(MVT::v128i1, &Hexagon::HvxQRRegClass); |
| 54 | addRegisterClass(MVT::v1024i1, &Hexagon::HvxQRRegClass); |
| 55 | } |
| 56 | |
| 57 | // Set up operation actions. |
| 58 | |
| 59 | bool Use64b = Subtarget.useHVX64BOps(); |
| 60 | ArrayRef<MVT> LegalV = Use64b ? LegalV64 : LegalV128; |
| 61 | ArrayRef<MVT> LegalW = Use64b ? LegalW64 : LegalW128; |
| 62 | MVT ByteV = Use64b ? MVT::v64i8 : MVT::v128i8; |
| 63 | MVT ByteW = Use64b ? MVT::v128i8 : MVT::v256i8; |
| 64 | |
| 65 | auto setPromoteTo = [this] (unsigned Opc, MVT FromTy, MVT ToTy) { |
| 66 | setOperationAction(Opc, FromTy, Promote); |
| 67 | AddPromotedToType(Opc, FromTy, ToTy); |
| 68 | }; |
| 69 | |
| 70 | setOperationAction(ISD::VECTOR_SHUFFLE, ByteV, Legal); |
| 71 | setOperationAction(ISD::VECTOR_SHUFFLE, ByteW, Legal); |
| 72 | setOperationAction(ISD::AND, ByteV, Legal); |
| 73 | setOperationAction(ISD::OR, ByteV, Legal); |
| 74 | setOperationAction(ISD::XOR, ByteV, Legal); |
| 75 | |
| 76 | for (MVT T : LegalV) { |
| 77 | setIndexedLoadAction(ISD::POST_INC, T, Legal); |
| 78 | setIndexedStoreAction(ISD::POST_INC, T, Legal); |
| 79 | |
| 80 | setOperationAction(ISD::ADD, T, Legal); |
| 81 | setOperationAction(ISD::SUB, T, Legal); |
| 82 | if (T != ByteV) { |
| 83 | setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, T, Legal); |
| 84 | setOperationAction(ISD::ZERO_EXTEND_VECTOR_INREG, T, Legal); |
| 85 | } |
| 86 | |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 87 | setOperationAction(ISD::LOAD, T, Custom); |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 88 | setOperationAction(ISD::MUL, T, Custom); |
| 89 | setOperationAction(ISD::MULHS, T, Custom); |
| 90 | setOperationAction(ISD::MULHU, T, Custom); |
| 91 | setOperationAction(ISD::BUILD_VECTOR, T, Custom); |
| 92 | // Make concat-vectors custom to handle concats of more than 2 vectors. |
| 93 | setOperationAction(ISD::CONCAT_VECTORS, T, Custom); |
| 94 | setOperationAction(ISD::INSERT_SUBVECTOR, T, Custom); |
| 95 | setOperationAction(ISD::INSERT_VECTOR_ELT, T, Custom); |
| 96 | setOperationAction(ISD::EXTRACT_SUBVECTOR, T, Custom); |
| 97 | setOperationAction(ISD::EXTRACT_VECTOR_ELT, T, Custom); |
| 98 | setOperationAction(ISD::ANY_EXTEND, T, Custom); |
| 99 | setOperationAction(ISD::SIGN_EXTEND, T, Custom); |
| 100 | setOperationAction(ISD::ZERO_EXTEND, T, Custom); |
| 101 | if (T != ByteV) { |
| 102 | setOperationAction(ISD::ANY_EXTEND_VECTOR_INREG, T, Custom); |
| 103 | // HVX only has shifts of words and halfwords. |
| 104 | setOperationAction(ISD::SRA, T, Custom); |
| 105 | setOperationAction(ISD::SHL, T, Custom); |
| 106 | setOperationAction(ISD::SRL, T, Custom); |
| 107 | } |
| 108 | |
| 109 | setCondCodeAction(ISD::SETNE, T, Expand); |
| 110 | setCondCodeAction(ISD::SETLE, T, Expand); |
| 111 | setCondCodeAction(ISD::SETGE, T, Expand); |
| 112 | setCondCodeAction(ISD::SETLT, T, Expand); |
| 113 | setCondCodeAction(ISD::SETULE, T, Expand); |
| 114 | setCondCodeAction(ISD::SETUGE, T, Expand); |
| 115 | setCondCodeAction(ISD::SETULT, T, Expand); |
| 116 | } |
| 117 | |
| 118 | for (MVT T : LegalV) { |
| 119 | MVT BoolV = MVT::getVectorVT(MVT::i1, T.getVectorNumElements()); |
| 120 | setOperationAction(ISD::BUILD_VECTOR, BoolV, Custom); |
| 121 | setOperationAction(ISD::CONCAT_VECTORS, BoolV, Custom); |
| 122 | setOperationAction(ISD::INSERT_SUBVECTOR, BoolV, Custom); |
| 123 | setOperationAction(ISD::INSERT_VECTOR_ELT, BoolV, Custom); |
| 124 | setOperationAction(ISD::EXTRACT_SUBVECTOR, BoolV, Custom); |
| 125 | setOperationAction(ISD::EXTRACT_VECTOR_ELT, BoolV, Custom); |
| 126 | } |
| 127 | |
| 128 | for (MVT T : LegalV) { |
| 129 | if (T == ByteV) |
| 130 | continue; |
| 131 | // Promote all shuffles to operate on vectors of bytes. |
| 132 | setPromoteTo(ISD::VECTOR_SHUFFLE, T, ByteV); |
| 133 | setPromoteTo(ISD::AND, T, ByteV); |
| 134 | setPromoteTo(ISD::OR, T, ByteV); |
| 135 | setPromoteTo(ISD::XOR, T, ByteV); |
| 136 | } |
| 137 | |
| 138 | for (MVT T : LegalW) { |
| 139 | // Custom-lower BUILD_VECTOR for vector pairs. The standard (target- |
| 140 | // independent) handling of it would convert it to a load, which is |
| 141 | // not always the optimal choice. |
| 142 | setOperationAction(ISD::BUILD_VECTOR, T, Custom); |
| 143 | // Make concat-vectors custom to handle concats of more than 2 vectors. |
| 144 | setOperationAction(ISD::CONCAT_VECTORS, T, Custom); |
| 145 | |
| 146 | // Custom-lower these operations for pairs. Expand them into a concat |
| 147 | // of the corresponding operations on individual vectors. |
| 148 | setOperationAction(ISD::ANY_EXTEND, T, Custom); |
| 149 | setOperationAction(ISD::SIGN_EXTEND, T, Custom); |
| 150 | setOperationAction(ISD::ZERO_EXTEND, T, Custom); |
| 151 | setOperationAction(ISD::SIGN_EXTEND_INREG, T, Custom); |
| 152 | setOperationAction(ISD::ANY_EXTEND_VECTOR_INREG, T, Custom); |
| 153 | setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, T, Legal); |
| 154 | setOperationAction(ISD::ZERO_EXTEND_VECTOR_INREG, T, Legal); |
| 155 | |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 156 | setOperationAction(ISD::LOAD, T, Custom); |
| 157 | setOperationAction(ISD::STORE, T, Custom); |
| 158 | |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 159 | setOperationAction(ISD::ADD, T, Legal); |
| 160 | setOperationAction(ISD::SUB, T, Legal); |
| 161 | setOperationAction(ISD::MUL, T, Custom); |
| 162 | setOperationAction(ISD::MULHS, T, Custom); |
| 163 | setOperationAction(ISD::MULHU, T, Custom); |
| 164 | setOperationAction(ISD::AND, T, Custom); |
| 165 | setOperationAction(ISD::OR, T, Custom); |
| 166 | setOperationAction(ISD::XOR, T, Custom); |
| 167 | setOperationAction(ISD::SETCC, T, Custom); |
| 168 | setOperationAction(ISD::VSELECT, T, Custom); |
| 169 | if (T != ByteW) { |
| 170 | setOperationAction(ISD::SRA, T, Custom); |
| 171 | setOperationAction(ISD::SHL, T, Custom); |
| 172 | setOperationAction(ISD::SRL, T, Custom); |
| 173 | |
| 174 | // Promote all shuffles to operate on vectors of bytes. |
| 175 | setPromoteTo(ISD::VECTOR_SHUFFLE, T, ByteW); |
| 176 | } |
| 177 | |
| 178 | MVT BoolV = MVT::getVectorVT(MVT::i1, T.getVectorNumElements()); |
| 179 | setOperationAction(ISD::SETCC, BoolV, Custom); |
| 180 | } |
| 181 | } |
| 182 | |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 183 | SDValue |
| 184 | HexagonTargetLowering::getInt(unsigned IntId, MVT ResTy, ArrayRef<SDValue> Ops, |
| 185 | const SDLoc &dl, SelectionDAG &DAG) const { |
| 186 | SmallVector<SDValue,4> IntOps; |
| 187 | IntOps.push_back(DAG.getConstant(IntId, dl, MVT::i32)); |
| 188 | for (const SDValue &Op : Ops) |
| 189 | IntOps.push_back(Op); |
| 190 | return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, ResTy, IntOps); |
| 191 | } |
| 192 | |
| 193 | MVT |
| 194 | HexagonTargetLowering::typeJoin(const TypePair &Tys) const { |
| 195 | assert(Tys.first.getVectorElementType() == Tys.second.getVectorElementType()); |
| 196 | |
| 197 | MVT ElemTy = Tys.first.getVectorElementType(); |
| 198 | return MVT::getVectorVT(ElemTy, Tys.first.getVectorNumElements() + |
| 199 | Tys.second.getVectorNumElements()); |
| 200 | } |
| 201 | |
| 202 | HexagonTargetLowering::TypePair |
| 203 | HexagonTargetLowering::typeSplit(MVT VecTy) const { |
| 204 | assert(VecTy.isVector()); |
| 205 | unsigned NumElem = VecTy.getVectorNumElements(); |
| 206 | assert((NumElem % 2) == 0 && "Expecting even-sized vector type"); |
| 207 | MVT HalfTy = MVT::getVectorVT(VecTy.getVectorElementType(), NumElem/2); |
| 208 | return { HalfTy, HalfTy }; |
| 209 | } |
| 210 | |
| 211 | MVT |
| 212 | HexagonTargetLowering::typeExtElem(MVT VecTy, unsigned Factor) const { |
| 213 | MVT ElemTy = VecTy.getVectorElementType(); |
| 214 | MVT NewElemTy = MVT::getIntegerVT(ElemTy.getSizeInBits() * Factor); |
| 215 | return MVT::getVectorVT(NewElemTy, VecTy.getVectorNumElements()); |
| 216 | } |
| 217 | |
| 218 | MVT |
| 219 | HexagonTargetLowering::typeTruncElem(MVT VecTy, unsigned Factor) const { |
| 220 | MVT ElemTy = VecTy.getVectorElementType(); |
| 221 | MVT NewElemTy = MVT::getIntegerVT(ElemTy.getSizeInBits() / Factor); |
| 222 | return MVT::getVectorVT(NewElemTy, VecTy.getVectorNumElements()); |
| 223 | } |
| 224 | |
| 225 | SDValue |
| 226 | HexagonTargetLowering::opCastElem(SDValue Vec, MVT ElemTy, |
| 227 | SelectionDAG &DAG) const { |
| 228 | if (ty(Vec).getVectorElementType() == ElemTy) |
| 229 | return Vec; |
| 230 | MVT CastTy = tyVector(Vec.getValueType().getSimpleVT(), ElemTy); |
| 231 | return DAG.getBitcast(CastTy, Vec); |
| 232 | } |
| 233 | |
| 234 | SDValue |
| 235 | HexagonTargetLowering::opJoin(const VectorPair &Ops, const SDLoc &dl, |
| 236 | SelectionDAG &DAG) const { |
| 237 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, typeJoin(ty(Ops)), |
| 238 | Ops.second, Ops.first); |
| 239 | } |
| 240 | |
| 241 | HexagonTargetLowering::VectorPair |
| 242 | HexagonTargetLowering::opSplit(SDValue Vec, const SDLoc &dl, |
| 243 | SelectionDAG &DAG) const { |
| 244 | TypePair Tys = typeSplit(ty(Vec)); |
Krzysztof Parzyszek | 1d52a85 | 2018-02-06 15:15:13 +0000 | [diff] [blame] | 245 | if (Vec.getOpcode() == HexagonISD::QCAT) |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 246 | return VectorPair(Vec.getOperand(0), Vec.getOperand(1)); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 247 | return DAG.SplitVector(Vec, dl, Tys.first, Tys.second); |
| 248 | } |
| 249 | |
Krzysztof Parzyszek | 7b52cf1 | 2018-02-06 14:21:31 +0000 | [diff] [blame] | 250 | bool |
| 251 | HexagonTargetLowering::isHvxSingleTy(MVT Ty) const { |
| 252 | return Subtarget.isHVXVectorType(Ty) && |
| 253 | Ty.getSizeInBits() == 8 * Subtarget.getVectorLength(); |
| 254 | } |
| 255 | |
| 256 | bool |
| 257 | HexagonTargetLowering::isHvxPairTy(MVT Ty) const { |
| 258 | return Subtarget.isHVXVectorType(Ty) && |
| 259 | Ty.getSizeInBits() == 16 * Subtarget.getVectorLength(); |
| 260 | } |
| 261 | |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 262 | SDValue |
| 263 | HexagonTargetLowering::convertToByteIndex(SDValue ElemIdx, MVT ElemTy, |
| 264 | SelectionDAG &DAG) const { |
| 265 | if (ElemIdx.getValueType().getSimpleVT() != MVT::i32) |
| 266 | ElemIdx = DAG.getBitcast(MVT::i32, ElemIdx); |
| 267 | |
| 268 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 269 | if (ElemWidth == 8) |
| 270 | return ElemIdx; |
| 271 | |
| 272 | unsigned L = Log2_32(ElemWidth/8); |
| 273 | const SDLoc &dl(ElemIdx); |
| 274 | return DAG.getNode(ISD::SHL, dl, MVT::i32, |
| 275 | {ElemIdx, DAG.getConstant(L, dl, MVT::i32)}); |
| 276 | } |
| 277 | |
| 278 | SDValue |
| 279 | HexagonTargetLowering::getIndexInWord32(SDValue Idx, MVT ElemTy, |
| 280 | SelectionDAG &DAG) const { |
| 281 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 282 | assert(ElemWidth >= 8 && ElemWidth <= 32); |
| 283 | if (ElemWidth == 32) |
| 284 | return Idx; |
| 285 | |
| 286 | if (ty(Idx) != MVT::i32) |
| 287 | Idx = DAG.getBitcast(MVT::i32, Idx); |
| 288 | const SDLoc &dl(Idx); |
| 289 | SDValue Mask = DAG.getConstant(32/ElemWidth - 1, dl, MVT::i32); |
| 290 | SDValue SubIdx = DAG.getNode(ISD::AND, dl, MVT::i32, {Idx, Mask}); |
| 291 | return SubIdx; |
| 292 | } |
| 293 | |
| 294 | SDValue |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 295 | HexagonTargetLowering::getByteShuffle(const SDLoc &dl, SDValue Op0, |
| 296 | SDValue Op1, ArrayRef<int> Mask, |
| 297 | SelectionDAG &DAG) const { |
| 298 | MVT OpTy = ty(Op0); |
| 299 | assert(OpTy == ty(Op1)); |
| 300 | |
| 301 | MVT ElemTy = OpTy.getVectorElementType(); |
| 302 | if (ElemTy == MVT::i8) |
| 303 | return DAG.getVectorShuffle(OpTy, dl, Op0, Op1, Mask); |
| 304 | assert(ElemTy.getSizeInBits() >= 8); |
| 305 | |
| 306 | MVT ResTy = tyVector(OpTy, MVT::i8); |
| 307 | unsigned ElemSize = ElemTy.getSizeInBits() / 8; |
| 308 | |
| 309 | SmallVector<int,128> ByteMask; |
| 310 | for (int M : Mask) { |
| 311 | if (M < 0) { |
| 312 | for (unsigned I = 0; I != ElemSize; ++I) |
| 313 | ByteMask.push_back(-1); |
| 314 | } else { |
| 315 | int NewM = M*ElemSize; |
| 316 | for (unsigned I = 0; I != ElemSize; ++I) |
| 317 | ByteMask.push_back(NewM+I); |
| 318 | } |
| 319 | } |
| 320 | assert(ResTy.getVectorNumElements() == ByteMask.size()); |
| 321 | return DAG.getVectorShuffle(ResTy, dl, opCastElem(Op0, MVT::i8, DAG), |
| 322 | opCastElem(Op1, MVT::i8, DAG), ByteMask); |
| 323 | } |
| 324 | |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 325 | SDValue |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 326 | HexagonTargetLowering::buildHvxVectorReg(ArrayRef<SDValue> Values, |
| 327 | const SDLoc &dl, MVT VecTy, |
| 328 | SelectionDAG &DAG) const { |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 329 | unsigned VecLen = Values.size(); |
| 330 | MachineFunction &MF = DAG.getMachineFunction(); |
| 331 | MVT ElemTy = VecTy.getVectorElementType(); |
| 332 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 333 | unsigned HwLen = Subtarget.getVectorLength(); |
| 334 | |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 335 | unsigned ElemSize = ElemWidth / 8; |
| 336 | assert(ElemSize*VecLen == HwLen); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 337 | SmallVector<SDValue,32> Words; |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 338 | |
| 339 | if (VecTy.getVectorElementType() != MVT::i32) { |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 340 | assert((ElemSize == 1 || ElemSize == 2) && "Invalid element size"); |
| 341 | unsigned OpsPerWord = (ElemSize == 1) ? 4 : 2; |
| 342 | MVT PartVT = MVT::getVectorVT(VecTy.getVectorElementType(), OpsPerWord); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 343 | for (unsigned i = 0; i != VecLen; i += OpsPerWord) { |
| 344 | SDValue W = buildVector32(Values.slice(i, OpsPerWord), dl, PartVT, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 345 | Words.push_back(DAG.getBitcast(MVT::i32, W)); |
| 346 | } |
| 347 | } else { |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 348 | Words.assign(Values.begin(), Values.end()); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 349 | } |
| 350 | |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 351 | unsigned NumWords = Words.size(); |
Krzysztof Parzyszek | 82a8339 | 2018-01-31 16:52:15 +0000 | [diff] [blame] | 352 | bool IsSplat = true, IsUndef = true; |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 353 | SDValue SplatV; |
| 354 | for (unsigned i = 0; i != NumWords && IsSplat; ++i) { |
| 355 | if (isUndef(Words[i])) |
| 356 | continue; |
Krzysztof Parzyszek | 82a8339 | 2018-01-31 16:52:15 +0000 | [diff] [blame] | 357 | IsUndef = false; |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 358 | if (!SplatV.getNode()) |
| 359 | SplatV = Words[i]; |
| 360 | else if (SplatV != Words[i]) |
| 361 | IsSplat = false; |
| 362 | } |
Krzysztof Parzyszek | 82a8339 | 2018-01-31 16:52:15 +0000 | [diff] [blame] | 363 | if (IsUndef) |
| 364 | return DAG.getUNDEF(VecTy); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 365 | if (IsSplat) { |
| 366 | assert(SplatV.getNode()); |
Krzysztof Parzyszek | 90ca4e8 | 2018-01-26 21:54:56 +0000 | [diff] [blame] | 367 | auto *IdxN = dyn_cast<ConstantSDNode>(SplatV.getNode()); |
| 368 | if (IdxN && IdxN->isNullValue()) |
| 369 | return getZero(dl, VecTy, DAG); |
| 370 | MVT WordTy = MVT::getVectorVT(MVT::i32, HwLen/4); |
| 371 | SDValue SV = DAG.getNode(HexagonISD::VSPLAT, dl, WordTy, SplatV); |
| 372 | return DAG.getBitcast(VecTy, SV); |
| 373 | } |
| 374 | |
| 375 | // Delay recognizing constant vectors until here, so that we can generate |
| 376 | // a vsplat. |
| 377 | SmallVector<ConstantInt*, 128> Consts(VecLen); |
| 378 | bool AllConst = getBuildVectorConstInts(Values, VecTy, DAG, Consts); |
| 379 | if (AllConst) { |
| 380 | ArrayRef<Constant*> Tmp((Constant**)Consts.begin(), |
| 381 | (Constant**)Consts.end()); |
| 382 | Constant *CV = ConstantVector::get(Tmp); |
| 383 | unsigned Align = HwLen; |
| 384 | SDValue CP = LowerConstantPool(DAG.getConstantPool(CV, VecTy, Align), DAG); |
| 385 | return DAG.getLoad(VecTy, dl, DAG.getEntryNode(), CP, |
| 386 | MachinePointerInfo::getConstantPool(MF), Align); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 387 | } |
| 388 | |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 389 | // Construct two halves in parallel, then or them together. |
| 390 | assert(4*Words.size() == Subtarget.getVectorLength()); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 391 | SDValue HalfV0 = getInstr(Hexagon::V6_vd0, dl, VecTy, {}, DAG); |
| 392 | SDValue HalfV1 = getInstr(Hexagon::V6_vd0, dl, VecTy, {}, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 393 | SDValue S = DAG.getConstant(4, dl, MVT::i32); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 394 | for (unsigned i = 0; i != NumWords/2; ++i) { |
| 395 | SDValue N = DAG.getNode(HexagonISD::VINSERTW0, dl, VecTy, |
| 396 | {HalfV0, Words[i]}); |
| 397 | SDValue M = DAG.getNode(HexagonISD::VINSERTW0, dl, VecTy, |
| 398 | {HalfV1, Words[i+NumWords/2]}); |
| 399 | HalfV0 = DAG.getNode(HexagonISD::VROR, dl, VecTy, {N, S}); |
| 400 | HalfV1 = DAG.getNode(HexagonISD::VROR, dl, VecTy, {M, S}); |
| 401 | } |
| 402 | |
| 403 | HalfV0 = DAG.getNode(HexagonISD::VROR, dl, VecTy, |
| 404 | {HalfV0, DAG.getConstant(HwLen/2, dl, MVT::i32)}); |
| 405 | SDValue DstV = DAG.getNode(ISD::OR, dl, VecTy, {HalfV0, HalfV1}); |
| 406 | return DstV; |
| 407 | } |
| 408 | |
| 409 | SDValue |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 410 | HexagonTargetLowering::createHvxPrefixPred(SDValue PredV, const SDLoc &dl, |
| 411 | unsigned BitBytes, bool ZeroFill, SelectionDAG &DAG) const { |
| 412 | MVT PredTy = ty(PredV); |
| 413 | unsigned HwLen = Subtarget.getVectorLength(); |
| 414 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 415 | |
| 416 | if (Subtarget.isHVXVectorType(PredTy, true)) { |
| 417 | // Move the vector predicate SubV to a vector register, and scale it |
| 418 | // down to match the representation (bytes per type element) that VecV |
| 419 | // uses. The scaling down will pick every 2nd or 4th (every Scale-th |
Hiroshi Inoue | 0909ca1 | 2018-01-26 08:15:29 +0000 | [diff] [blame] | 420 | // in general) element and put them at the front of the resulting |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 421 | // vector. This subvector will then be inserted into the Q2V of VecV. |
| 422 | // To avoid having an operation that generates an illegal type (short |
| 423 | // vector), generate a full size vector. |
| 424 | // |
| 425 | SDValue T = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, PredV); |
| 426 | SmallVector<int,128> Mask(HwLen); |
| 427 | // Scale = BitBytes(PredV) / Given BitBytes. |
| 428 | unsigned Scale = HwLen / (PredTy.getVectorNumElements() * BitBytes); |
| 429 | unsigned BlockLen = PredTy.getVectorNumElements() * BitBytes; |
| 430 | |
| 431 | for (unsigned i = 0; i != HwLen; ++i) { |
| 432 | unsigned Num = i % Scale; |
| 433 | unsigned Off = i / Scale; |
| 434 | Mask[BlockLen*Num + Off] = i; |
| 435 | } |
| 436 | SDValue S = DAG.getVectorShuffle(ByteTy, dl, T, DAG.getUNDEF(ByteTy), Mask); |
| 437 | if (!ZeroFill) |
| 438 | return S; |
| 439 | // Fill the bytes beyond BlockLen with 0s. |
| 440 | MVT BoolTy = MVT::getVectorVT(MVT::i1, HwLen); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 441 | SDValue Q = getInstr(Hexagon::V6_pred_scalar2, dl, BoolTy, |
| 442 | {DAG.getConstant(BlockLen, dl, MVT::i32)}, DAG); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 443 | SDValue M = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, Q); |
| 444 | return DAG.getNode(ISD::AND, dl, ByteTy, S, M); |
| 445 | } |
| 446 | |
| 447 | // Make sure that this is a valid scalar predicate. |
| 448 | assert(PredTy == MVT::v2i1 || PredTy == MVT::v4i1 || PredTy == MVT::v8i1); |
| 449 | |
| 450 | unsigned Bytes = 8 / PredTy.getVectorNumElements(); |
| 451 | SmallVector<SDValue,4> Words[2]; |
| 452 | unsigned IdxW = 0; |
| 453 | |
| 454 | auto Lo32 = [&DAG, &dl] (SDValue P) { |
| 455 | return DAG.getTargetExtractSubreg(Hexagon::isub_lo, dl, MVT::i32, P); |
| 456 | }; |
| 457 | auto Hi32 = [&DAG, &dl] (SDValue P) { |
| 458 | return DAG.getTargetExtractSubreg(Hexagon::isub_hi, dl, MVT::i32, P); |
| 459 | }; |
| 460 | |
| 461 | SDValue W0 = isUndef(PredV) |
| 462 | ? DAG.getUNDEF(MVT::i64) |
| 463 | : DAG.getNode(HexagonISD::P2D, dl, MVT::i64, PredV); |
| 464 | Words[IdxW].push_back(Hi32(W0)); |
| 465 | Words[IdxW].push_back(Lo32(W0)); |
| 466 | |
| 467 | while (Bytes < BitBytes) { |
| 468 | IdxW ^= 1; |
| 469 | Words[IdxW].clear(); |
| 470 | |
| 471 | if (Bytes < 4) { |
| 472 | for (const SDValue &W : Words[IdxW ^ 1]) { |
| 473 | SDValue T = expandPredicate(W, dl, DAG); |
| 474 | Words[IdxW].push_back(Hi32(T)); |
| 475 | Words[IdxW].push_back(Lo32(T)); |
| 476 | } |
| 477 | } else { |
| 478 | for (const SDValue &W : Words[IdxW ^ 1]) { |
| 479 | Words[IdxW].push_back(W); |
| 480 | Words[IdxW].push_back(W); |
| 481 | } |
| 482 | } |
| 483 | Bytes *= 2; |
| 484 | } |
| 485 | |
| 486 | assert(Bytes == BitBytes); |
| 487 | |
| 488 | SDValue Vec = ZeroFill ? getZero(dl, ByteTy, DAG) : DAG.getUNDEF(ByteTy); |
| 489 | SDValue S4 = DAG.getConstant(HwLen-4, dl, MVT::i32); |
| 490 | for (const SDValue &W : Words[IdxW]) { |
| 491 | Vec = DAG.getNode(HexagonISD::VROR, dl, ByteTy, Vec, S4); |
| 492 | Vec = DAG.getNode(HexagonISD::VINSERTW0, dl, ByteTy, Vec, W); |
| 493 | } |
| 494 | |
| 495 | return Vec; |
| 496 | } |
| 497 | |
| 498 | SDValue |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 499 | HexagonTargetLowering::buildHvxVectorPred(ArrayRef<SDValue> Values, |
| 500 | const SDLoc &dl, MVT VecTy, |
| 501 | SelectionDAG &DAG) const { |
| 502 | // Construct a vector V of bytes, such that a comparison V >u 0 would |
| 503 | // produce the required vector predicate. |
| 504 | unsigned VecLen = Values.size(); |
| 505 | unsigned HwLen = Subtarget.getVectorLength(); |
| 506 | assert(VecLen <= HwLen || VecLen == 8*HwLen); |
| 507 | SmallVector<SDValue,128> Bytes; |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 508 | bool AllT = true, AllF = true; |
| 509 | |
| 510 | auto IsTrue = [] (SDValue V) { |
| 511 | if (const auto *N = dyn_cast<ConstantSDNode>(V.getNode())) |
| 512 | return !N->isNullValue(); |
| 513 | return false; |
| 514 | }; |
| 515 | auto IsFalse = [] (SDValue V) { |
| 516 | if (const auto *N = dyn_cast<ConstantSDNode>(V.getNode())) |
| 517 | return N->isNullValue(); |
| 518 | return false; |
| 519 | }; |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 520 | |
| 521 | if (VecLen <= HwLen) { |
| 522 | // In the hardware, each bit of a vector predicate corresponds to a byte |
| 523 | // of a vector register. Calculate how many bytes does a bit of VecTy |
| 524 | // correspond to. |
| 525 | assert(HwLen % VecLen == 0); |
| 526 | unsigned BitBytes = HwLen / VecLen; |
| 527 | for (SDValue V : Values) { |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 528 | AllT &= IsTrue(V); |
| 529 | AllF &= IsFalse(V); |
| 530 | |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 531 | SDValue Ext = !V.isUndef() ? DAG.getZExtOrTrunc(V, dl, MVT::i8) |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 532 | : DAG.getUNDEF(MVT::i8); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 533 | for (unsigned B = 0; B != BitBytes; ++B) |
| 534 | Bytes.push_back(Ext); |
| 535 | } |
| 536 | } else { |
| 537 | // There are as many i1 values, as there are bits in a vector register. |
| 538 | // Divide the values into groups of 8 and check that each group consists |
| 539 | // of the same value (ignoring undefs). |
| 540 | for (unsigned I = 0; I != VecLen; I += 8) { |
| 541 | unsigned B = 0; |
| 542 | // Find the first non-undef value in this group. |
| 543 | for (; B != 8; ++B) { |
| 544 | if (!Values[I+B].isUndef()) |
| 545 | break; |
| 546 | } |
| 547 | SDValue F = Values[I+B]; |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 548 | AllT &= IsTrue(F); |
| 549 | AllF &= IsFalse(F); |
| 550 | |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 551 | SDValue Ext = (B < 8) ? DAG.getZExtOrTrunc(F, dl, MVT::i8) |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 552 | : DAG.getUNDEF(MVT::i8); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 553 | Bytes.push_back(Ext); |
| 554 | // Verify that the rest of values in the group are the same as the |
| 555 | // first. |
| 556 | for (; B != 8; ++B) |
| 557 | assert(Values[I+B].isUndef() || Values[I+B] == F); |
| 558 | } |
| 559 | } |
| 560 | |
Krzysztof Parzyszek | 69f1d7e | 2018-02-06 14:16:52 +0000 | [diff] [blame] | 561 | if (AllT) |
| 562 | return DAG.getNode(HexagonISD::QTRUE, dl, VecTy); |
| 563 | if (AllF) |
| 564 | return DAG.getNode(HexagonISD::QFALSE, dl, VecTy); |
| 565 | |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 566 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 567 | SDValue ByteVec = buildHvxVectorReg(Bytes, dl, ByteTy, DAG); |
| 568 | return DAG.getNode(HexagonISD::V2Q, dl, VecTy, ByteVec); |
| 569 | } |
| 570 | |
| 571 | SDValue |
| 572 | HexagonTargetLowering::extractHvxElementReg(SDValue VecV, SDValue IdxV, |
| 573 | const SDLoc &dl, MVT ResTy, SelectionDAG &DAG) const { |
| 574 | MVT ElemTy = ty(VecV).getVectorElementType(); |
| 575 | |
| 576 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 577 | assert(ElemWidth >= 8 && ElemWidth <= 32); |
| 578 | (void)ElemWidth; |
| 579 | |
| 580 | SDValue ByteIdx = convertToByteIndex(IdxV, ElemTy, DAG); |
| 581 | SDValue ExWord = DAG.getNode(HexagonISD::VEXTRACTW, dl, MVT::i32, |
| 582 | {VecV, ByteIdx}); |
| 583 | if (ElemTy == MVT::i32) |
| 584 | return ExWord; |
| 585 | |
| 586 | // Have an extracted word, need to extract the smaller element out of it. |
| 587 | // 1. Extract the bits of (the original) IdxV that correspond to the index |
| 588 | // of the desired element in the 32-bit word. |
| 589 | SDValue SubIdx = getIndexInWord32(IdxV, ElemTy, DAG); |
| 590 | // 2. Extract the element from the word. |
| 591 | SDValue ExVec = DAG.getBitcast(tyVector(ty(ExWord), ElemTy), ExWord); |
| 592 | return extractVector(ExVec, SubIdx, dl, ElemTy, MVT::i32, DAG); |
| 593 | } |
| 594 | |
| 595 | SDValue |
| 596 | HexagonTargetLowering::extractHvxElementPred(SDValue VecV, SDValue IdxV, |
| 597 | const SDLoc &dl, MVT ResTy, SelectionDAG &DAG) const { |
| 598 | // Implement other return types if necessary. |
| 599 | assert(ResTy == MVT::i1); |
| 600 | |
| 601 | unsigned HwLen = Subtarget.getVectorLength(); |
| 602 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 603 | SDValue ByteVec = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, VecV); |
| 604 | |
| 605 | unsigned Scale = HwLen / ty(VecV).getVectorNumElements(); |
| 606 | SDValue ScV = DAG.getConstant(Scale, dl, MVT::i32); |
| 607 | IdxV = DAG.getNode(ISD::MUL, dl, MVT::i32, IdxV, ScV); |
| 608 | |
| 609 | SDValue ExtB = extractHvxElementReg(ByteVec, IdxV, dl, MVT::i32, DAG); |
| 610 | SDValue Zero = DAG.getTargetConstant(0, dl, MVT::i32); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 611 | return getInstr(Hexagon::C2_cmpgtui, dl, MVT::i1, {ExtB, Zero}, DAG); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 612 | } |
| 613 | |
| 614 | SDValue |
| 615 | HexagonTargetLowering::insertHvxElementReg(SDValue VecV, SDValue IdxV, |
| 616 | SDValue ValV, const SDLoc &dl, SelectionDAG &DAG) const { |
| 617 | MVT ElemTy = ty(VecV).getVectorElementType(); |
| 618 | |
| 619 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 620 | assert(ElemWidth >= 8 && ElemWidth <= 32); |
| 621 | (void)ElemWidth; |
| 622 | |
| 623 | auto InsertWord = [&DAG,&dl,this] (SDValue VecV, SDValue ValV, |
| 624 | SDValue ByteIdxV) { |
| 625 | MVT VecTy = ty(VecV); |
| 626 | unsigned HwLen = Subtarget.getVectorLength(); |
| 627 | SDValue MaskV = DAG.getNode(ISD::AND, dl, MVT::i32, |
| 628 | {ByteIdxV, DAG.getConstant(-4, dl, MVT::i32)}); |
| 629 | SDValue RotV = DAG.getNode(HexagonISD::VROR, dl, VecTy, {VecV, MaskV}); |
| 630 | SDValue InsV = DAG.getNode(HexagonISD::VINSERTW0, dl, VecTy, {RotV, ValV}); |
| 631 | SDValue SubV = DAG.getNode(ISD::SUB, dl, MVT::i32, |
| 632 | {DAG.getConstant(HwLen, dl, MVT::i32), MaskV}); |
| 633 | SDValue TorV = DAG.getNode(HexagonISD::VROR, dl, VecTy, {InsV, SubV}); |
| 634 | return TorV; |
| 635 | }; |
| 636 | |
| 637 | SDValue ByteIdx = convertToByteIndex(IdxV, ElemTy, DAG); |
| 638 | if (ElemTy == MVT::i32) |
| 639 | return InsertWord(VecV, ValV, ByteIdx); |
| 640 | |
| 641 | // If this is not inserting a 32-bit word, convert it into such a thing. |
| 642 | // 1. Extract the existing word from the target vector. |
| 643 | SDValue WordIdx = DAG.getNode(ISD::SRL, dl, MVT::i32, |
| 644 | {ByteIdx, DAG.getConstant(2, dl, MVT::i32)}); |
| 645 | SDValue Ext = extractHvxElementReg(opCastElem(VecV, MVT::i32, DAG), WordIdx, |
| 646 | dl, MVT::i32, DAG); |
| 647 | |
| 648 | // 2. Treating the extracted word as a 32-bit vector, insert the given |
| 649 | // value into it. |
| 650 | SDValue SubIdx = getIndexInWord32(IdxV, ElemTy, DAG); |
| 651 | MVT SubVecTy = tyVector(ty(Ext), ElemTy); |
| 652 | SDValue Ins = insertVector(DAG.getBitcast(SubVecTy, Ext), |
| 653 | ValV, SubIdx, dl, ElemTy, DAG); |
| 654 | |
| 655 | // 3. Insert the 32-bit word back into the original vector. |
| 656 | return InsertWord(VecV, Ins, ByteIdx); |
| 657 | } |
| 658 | |
| 659 | SDValue |
| 660 | HexagonTargetLowering::insertHvxElementPred(SDValue VecV, SDValue IdxV, |
| 661 | SDValue ValV, const SDLoc &dl, SelectionDAG &DAG) const { |
| 662 | unsigned HwLen = Subtarget.getVectorLength(); |
| 663 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 664 | SDValue ByteVec = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, VecV); |
| 665 | |
| 666 | unsigned Scale = HwLen / ty(VecV).getVectorNumElements(); |
| 667 | SDValue ScV = DAG.getConstant(Scale, dl, MVT::i32); |
| 668 | IdxV = DAG.getNode(ISD::MUL, dl, MVT::i32, IdxV, ScV); |
| 669 | ValV = DAG.getNode(ISD::SIGN_EXTEND, dl, MVT::i32, ValV); |
| 670 | |
| 671 | SDValue InsV = insertHvxElementReg(ByteVec, IdxV, ValV, dl, DAG); |
| 672 | return DAG.getNode(HexagonISD::V2Q, dl, ty(VecV), InsV); |
| 673 | } |
| 674 | |
| 675 | SDValue |
| 676 | HexagonTargetLowering::extractHvxSubvectorReg(SDValue VecV, SDValue IdxV, |
| 677 | const SDLoc &dl, MVT ResTy, SelectionDAG &DAG) const { |
| 678 | MVT VecTy = ty(VecV); |
| 679 | unsigned HwLen = Subtarget.getVectorLength(); |
| 680 | unsigned Idx = cast<ConstantSDNode>(IdxV.getNode())->getZExtValue(); |
| 681 | MVT ElemTy = VecTy.getVectorElementType(); |
| 682 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 683 | |
| 684 | // If the source vector is a vector pair, get the single vector containing |
| 685 | // the subvector of interest. The subvector will never overlap two single |
| 686 | // vectors. |
Krzysztof Parzyszek | 7b52cf1 | 2018-02-06 14:21:31 +0000 | [diff] [blame] | 687 | if (isHvxPairTy(VecTy)) { |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 688 | unsigned SubIdx; |
| 689 | if (Idx * ElemWidth >= 8*HwLen) { |
| 690 | SubIdx = Hexagon::vsub_hi; |
| 691 | Idx -= VecTy.getVectorNumElements() / 2; |
| 692 | } else { |
| 693 | SubIdx = Hexagon::vsub_lo; |
| 694 | } |
| 695 | VecTy = typeSplit(VecTy).first; |
| 696 | VecV = DAG.getTargetExtractSubreg(SubIdx, dl, VecTy, VecV); |
| 697 | if (VecTy == ResTy) |
| 698 | return VecV; |
| 699 | } |
| 700 | |
| 701 | // The only meaningful subvectors of a single HVX vector are those that |
| 702 | // fit in a scalar register. |
| 703 | assert(ResTy.getSizeInBits() == 32 || ResTy.getSizeInBits() == 64); |
| 704 | |
| 705 | MVT WordTy = tyVector(VecTy, MVT::i32); |
| 706 | SDValue WordVec = DAG.getBitcast(WordTy, VecV); |
| 707 | unsigned WordIdx = (Idx*ElemWidth) / 32; |
| 708 | |
| 709 | SDValue W0Idx = DAG.getConstant(WordIdx, dl, MVT::i32); |
| 710 | SDValue W0 = extractHvxElementReg(WordVec, W0Idx, dl, MVT::i32, DAG); |
| 711 | if (ResTy.getSizeInBits() == 32) |
| 712 | return DAG.getBitcast(ResTy, W0); |
| 713 | |
| 714 | SDValue W1Idx = DAG.getConstant(WordIdx+1, dl, MVT::i32); |
| 715 | SDValue W1 = extractHvxElementReg(WordVec, W1Idx, dl, MVT::i32, DAG); |
| 716 | SDValue WW = DAG.getNode(HexagonISD::COMBINE, dl, MVT::i64, {W1, W0}); |
| 717 | return DAG.getBitcast(ResTy, WW); |
| 718 | } |
| 719 | |
| 720 | SDValue |
| 721 | HexagonTargetLowering::extractHvxSubvectorPred(SDValue VecV, SDValue IdxV, |
| 722 | const SDLoc &dl, MVT ResTy, SelectionDAG &DAG) const { |
| 723 | MVT VecTy = ty(VecV); |
| 724 | unsigned HwLen = Subtarget.getVectorLength(); |
| 725 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 726 | SDValue ByteVec = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, VecV); |
| 727 | // IdxV is required to be a constant. |
| 728 | unsigned Idx = cast<ConstantSDNode>(IdxV.getNode())->getZExtValue(); |
| 729 | |
| 730 | unsigned ResLen = ResTy.getVectorNumElements(); |
| 731 | unsigned BitBytes = HwLen / VecTy.getVectorNumElements(); |
| 732 | unsigned Offset = Idx * BitBytes; |
| 733 | SDValue Undef = DAG.getUNDEF(ByteTy); |
| 734 | SmallVector<int,128> Mask; |
| 735 | |
| 736 | if (Subtarget.isHVXVectorType(ResTy, true)) { |
| 737 | // Converting between two vector predicates. Since the result is shorter |
| 738 | // than the source, it will correspond to a vector predicate with the |
| 739 | // relevant bits replicated. The replication count is the ratio of the |
| 740 | // source and target vector lengths. |
| 741 | unsigned Rep = VecTy.getVectorNumElements() / ResLen; |
| 742 | assert(isPowerOf2_32(Rep) && HwLen % Rep == 0); |
| 743 | for (unsigned i = 0; i != HwLen/Rep; ++i) { |
| 744 | for (unsigned j = 0; j != Rep; ++j) |
| 745 | Mask.push_back(i + Offset); |
| 746 | } |
| 747 | SDValue ShuffV = DAG.getVectorShuffle(ByteTy, dl, ByteVec, Undef, Mask); |
| 748 | return DAG.getNode(HexagonISD::V2Q, dl, ResTy, ShuffV); |
| 749 | } |
| 750 | |
| 751 | // Converting between a vector predicate and a scalar predicate. In the |
| 752 | // vector predicate, a group of BitBytes bits will correspond to a single |
| 753 | // i1 element of the source vector type. Those bits will all have the same |
| 754 | // value. The same will be true for ByteVec, where each byte corresponds |
| 755 | // to a bit in the vector predicate. |
| 756 | // The algorithm is to traverse the ByteVec, going over the i1 values from |
| 757 | // the source vector, and generate the corresponding representation in an |
| 758 | // 8-byte vector. To avoid repeated extracts from ByteVec, shuffle the |
| 759 | // elements so that the interesting 8 bytes will be in the low end of the |
| 760 | // vector. |
| 761 | unsigned Rep = 8 / ResLen; |
| 762 | // Make sure the output fill the entire vector register, so repeat the |
| 763 | // 8-byte groups as many times as necessary. |
| 764 | for (unsigned r = 0; r != HwLen/ResLen; ++r) { |
| 765 | // This will generate the indexes of the 8 interesting bytes. |
| 766 | for (unsigned i = 0; i != ResLen; ++i) { |
| 767 | for (unsigned j = 0; j != Rep; ++j) |
| 768 | Mask.push_back(Offset + i*BitBytes); |
| 769 | } |
| 770 | } |
| 771 | |
| 772 | SDValue Zero = getZero(dl, MVT::i32, DAG); |
| 773 | SDValue ShuffV = DAG.getVectorShuffle(ByteTy, dl, ByteVec, Undef, Mask); |
| 774 | // Combine the two low words from ShuffV into a v8i8, and byte-compare |
| 775 | // them against 0. |
| 776 | SDValue W0 = DAG.getNode(HexagonISD::VEXTRACTW, dl, MVT::i32, {ShuffV, Zero}); |
| 777 | SDValue W1 = DAG.getNode(HexagonISD::VEXTRACTW, dl, MVT::i32, |
| 778 | {ShuffV, DAG.getConstant(4, dl, MVT::i32)}); |
| 779 | SDValue Vec64 = DAG.getNode(HexagonISD::COMBINE, dl, MVT::v8i8, {W1, W0}); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 780 | return getInstr(Hexagon::A4_vcmpbgtui, dl, ResTy, |
| 781 | {Vec64, DAG.getTargetConstant(0, dl, MVT::i32)}, DAG); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 782 | } |
| 783 | |
| 784 | SDValue |
| 785 | HexagonTargetLowering::insertHvxSubvectorReg(SDValue VecV, SDValue SubV, |
| 786 | SDValue IdxV, const SDLoc &dl, SelectionDAG &DAG) const { |
| 787 | MVT VecTy = ty(VecV); |
| 788 | MVT SubTy = ty(SubV); |
| 789 | unsigned HwLen = Subtarget.getVectorLength(); |
| 790 | MVT ElemTy = VecTy.getVectorElementType(); |
| 791 | unsigned ElemWidth = ElemTy.getSizeInBits(); |
| 792 | |
Krzysztof Parzyszek | 7b52cf1 | 2018-02-06 14:21:31 +0000 | [diff] [blame] | 793 | bool IsPair = isHvxPairTy(VecTy); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 794 | MVT SingleTy = MVT::getVectorVT(ElemTy, (8*HwLen)/ElemWidth); |
| 795 | // The two single vectors that VecV consists of, if it's a pair. |
| 796 | SDValue V0, V1; |
| 797 | SDValue SingleV = VecV; |
| 798 | SDValue PickHi; |
| 799 | |
| 800 | if (IsPair) { |
| 801 | V0 = DAG.getTargetExtractSubreg(Hexagon::vsub_lo, dl, SingleTy, VecV); |
| 802 | V1 = DAG.getTargetExtractSubreg(Hexagon::vsub_hi, dl, SingleTy, VecV); |
| 803 | |
| 804 | SDValue HalfV = DAG.getConstant(SingleTy.getVectorNumElements(), |
| 805 | dl, MVT::i32); |
| 806 | PickHi = DAG.getSetCC(dl, MVT::i1, IdxV, HalfV, ISD::SETUGT); |
Krzysztof Parzyszek | 7b52cf1 | 2018-02-06 14:21:31 +0000 | [diff] [blame] | 807 | if (isHvxSingleTy(SubTy)) { |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 808 | if (const auto *CN = dyn_cast<const ConstantSDNode>(IdxV.getNode())) { |
| 809 | unsigned Idx = CN->getZExtValue(); |
| 810 | assert(Idx == 0 || Idx == VecTy.getVectorNumElements()/2); |
| 811 | unsigned SubIdx = (Idx == 0) ? Hexagon::vsub_lo : Hexagon::vsub_hi; |
| 812 | return DAG.getTargetInsertSubreg(SubIdx, dl, VecTy, VecV, SubV); |
| 813 | } |
| 814 | // If IdxV is not a constant, generate the two variants: with the |
| 815 | // SubV as the high and as the low subregister, and select the right |
| 816 | // pair based on the IdxV. |
| 817 | SDValue InLo = DAG.getNode(ISD::CONCAT_VECTORS, dl, VecTy, {SubV, V1}); |
| 818 | SDValue InHi = DAG.getNode(ISD::CONCAT_VECTORS, dl, VecTy, {V0, SubV}); |
| 819 | return DAG.getNode(ISD::SELECT, dl, VecTy, PickHi, InHi, InLo); |
| 820 | } |
| 821 | // The subvector being inserted must be entirely contained in one of |
| 822 | // the vectors V0 or V1. Set SingleV to the correct one, and update |
| 823 | // IdxV to be the index relative to the beginning of that vector. |
| 824 | SDValue S = DAG.getNode(ISD::SUB, dl, MVT::i32, IdxV, HalfV); |
| 825 | IdxV = DAG.getNode(ISD::SELECT, dl, MVT::i32, PickHi, S, IdxV); |
| 826 | SingleV = DAG.getNode(ISD::SELECT, dl, SingleTy, PickHi, V1, V0); |
| 827 | } |
| 828 | |
| 829 | // The only meaningful subvectors of a single HVX vector are those that |
| 830 | // fit in a scalar register. |
| 831 | assert(SubTy.getSizeInBits() == 32 || SubTy.getSizeInBits() == 64); |
| 832 | // Convert IdxV to be index in bytes. |
| 833 | auto *IdxN = dyn_cast<ConstantSDNode>(IdxV.getNode()); |
| 834 | if (!IdxN || !IdxN->isNullValue()) { |
| 835 | IdxV = DAG.getNode(ISD::MUL, dl, MVT::i32, IdxV, |
| 836 | DAG.getConstant(ElemWidth/8, dl, MVT::i32)); |
| 837 | SingleV = DAG.getNode(HexagonISD::VROR, dl, SingleTy, SingleV, IdxV); |
| 838 | } |
| 839 | // When inserting a single word, the rotation back to the original position |
| 840 | // would be by HwLen-Idx, but if two words are inserted, it will need to be |
| 841 | // by (HwLen-4)-Idx. |
| 842 | unsigned RolBase = HwLen; |
| 843 | if (VecTy.getSizeInBits() == 32) { |
| 844 | SDValue V = DAG.getBitcast(MVT::i32, SubV); |
| 845 | SingleV = DAG.getNode(HexagonISD::VINSERTW0, dl, SingleTy, V); |
| 846 | } else { |
| 847 | SDValue V = DAG.getBitcast(MVT::i64, SubV); |
| 848 | SDValue R0 = DAG.getTargetExtractSubreg(Hexagon::isub_lo, dl, MVT::i32, V); |
| 849 | SDValue R1 = DAG.getTargetExtractSubreg(Hexagon::isub_hi, dl, MVT::i32, V); |
| 850 | SingleV = DAG.getNode(HexagonISD::VINSERTW0, dl, SingleTy, SingleV, R0); |
| 851 | SingleV = DAG.getNode(HexagonISD::VROR, dl, SingleTy, SingleV, |
| 852 | DAG.getConstant(4, dl, MVT::i32)); |
| 853 | SingleV = DAG.getNode(HexagonISD::VINSERTW0, dl, SingleTy, SingleV, R1); |
| 854 | RolBase = HwLen-4; |
| 855 | } |
| 856 | // If the vector wasn't ror'ed, don't ror it back. |
| 857 | if (RolBase != 4 || !IdxN || !IdxN->isNullValue()) { |
| 858 | SDValue RolV = DAG.getNode(ISD::SUB, dl, MVT::i32, |
| 859 | DAG.getConstant(RolBase, dl, MVT::i32), IdxV); |
| 860 | SingleV = DAG.getNode(HexagonISD::VROR, dl, SingleTy, SingleV, RolV); |
| 861 | } |
| 862 | |
| 863 | if (IsPair) { |
| 864 | SDValue InLo = DAG.getNode(ISD::CONCAT_VECTORS, dl, VecTy, {SingleV, V1}); |
| 865 | SDValue InHi = DAG.getNode(ISD::CONCAT_VECTORS, dl, VecTy, {V0, SingleV}); |
| 866 | return DAG.getNode(ISD::SELECT, dl, VecTy, PickHi, InHi, InLo); |
| 867 | } |
| 868 | return SingleV; |
| 869 | } |
| 870 | |
| 871 | SDValue |
| 872 | HexagonTargetLowering::insertHvxSubvectorPred(SDValue VecV, SDValue SubV, |
| 873 | SDValue IdxV, const SDLoc &dl, SelectionDAG &DAG) const { |
| 874 | MVT VecTy = ty(VecV); |
| 875 | MVT SubTy = ty(SubV); |
| 876 | assert(Subtarget.isHVXVectorType(VecTy, true)); |
| 877 | // VecV is an HVX vector predicate. SubV may be either an HVX vector |
| 878 | // predicate as well, or it can be a scalar predicate. |
| 879 | |
| 880 | unsigned VecLen = VecTy.getVectorNumElements(); |
| 881 | unsigned HwLen = Subtarget.getVectorLength(); |
| 882 | assert(HwLen % VecLen == 0 && "Unexpected vector type"); |
| 883 | |
| 884 | unsigned Scale = VecLen / SubTy.getVectorNumElements(); |
| 885 | unsigned BitBytes = HwLen / VecLen; |
| 886 | unsigned BlockLen = HwLen / Scale; |
| 887 | |
| 888 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 889 | SDValue ByteVec = DAG.getNode(HexagonISD::Q2V, dl, ByteTy, VecV); |
| 890 | SDValue ByteSub = createHvxPrefixPred(SubV, dl, BitBytes, false, DAG); |
| 891 | SDValue ByteIdx; |
| 892 | |
| 893 | auto *IdxN = dyn_cast<ConstantSDNode>(IdxV.getNode()); |
| 894 | if (!IdxN || !IdxN->isNullValue()) { |
| 895 | ByteIdx = DAG.getNode(ISD::MUL, dl, MVT::i32, IdxV, |
| 896 | DAG.getConstant(BitBytes, dl, MVT::i32)); |
| 897 | ByteVec = DAG.getNode(HexagonISD::VROR, dl, ByteTy, ByteVec, ByteIdx); |
| 898 | } |
| 899 | |
| 900 | // ByteVec is the target vector VecV rotated in such a way that the |
| 901 | // subvector should be inserted at index 0. Generate a predicate mask |
| 902 | // and use vmux to do the insertion. |
| 903 | MVT BoolTy = MVT::getVectorVT(MVT::i1, HwLen); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 904 | SDValue Q = getInstr(Hexagon::V6_pred_scalar2, dl, BoolTy, |
| 905 | {DAG.getConstant(BlockLen, dl, MVT::i32)}, DAG); |
| 906 | ByteVec = getInstr(Hexagon::V6_vmux, dl, ByteTy, {Q, ByteSub, ByteVec}, DAG); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 907 | // Rotate ByteVec back, and convert to a vector predicate. |
| 908 | if (!IdxN || !IdxN->isNullValue()) { |
| 909 | SDValue HwLenV = DAG.getConstant(HwLen, dl, MVT::i32); |
| 910 | SDValue ByteXdi = DAG.getNode(ISD::SUB, dl, MVT::i32, HwLenV, ByteIdx); |
| 911 | ByteVec = DAG.getNode(HexagonISD::VROR, dl, ByteTy, ByteVec, ByteXdi); |
| 912 | } |
| 913 | return DAG.getNode(HexagonISD::V2Q, dl, VecTy, ByteVec); |
| 914 | } |
| 915 | |
| 916 | SDValue |
| 917 | HexagonTargetLowering::extendHvxVectorPred(SDValue VecV, const SDLoc &dl, |
| 918 | MVT ResTy, bool ZeroExt, SelectionDAG &DAG) const { |
| 919 | // Sign- and any-extending of a vector predicate to a vector register is |
| 920 | // equivalent to Q2V. For zero-extensions, generate a vmux between 0 and |
| 921 | // a vector of 1s (where the 1s are of type matching the vector type). |
| 922 | assert(Subtarget.isHVXVectorType(ResTy)); |
| 923 | if (!ZeroExt) |
| 924 | return DAG.getNode(HexagonISD::Q2V, dl, ResTy, VecV); |
| 925 | |
| 926 | assert(ty(VecV).getVectorNumElements() == ResTy.getVectorNumElements()); |
| 927 | SDValue True = DAG.getNode(HexagonISD::VSPLAT, dl, ResTy, |
| 928 | DAG.getConstant(1, dl, MVT::i32)); |
| 929 | SDValue False = getZero(dl, ResTy, DAG); |
| 930 | return DAG.getSelect(dl, ResTy, VecV, True, False); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 931 | } |
| 932 | |
| 933 | SDValue |
| 934 | HexagonTargetLowering::LowerHvxBuildVector(SDValue Op, SelectionDAG &DAG) |
| 935 | const { |
| 936 | const SDLoc &dl(Op); |
| 937 | MVT VecTy = ty(Op); |
| 938 | |
| 939 | unsigned Size = Op.getNumOperands(); |
| 940 | SmallVector<SDValue,128> Ops; |
| 941 | for (unsigned i = 0; i != Size; ++i) |
| 942 | Ops.push_back(Op.getOperand(i)); |
| 943 | |
| 944 | if (VecTy.getVectorElementType() == MVT::i1) |
| 945 | return buildHvxVectorPred(Ops, dl, VecTy, DAG); |
| 946 | |
| 947 | if (VecTy.getSizeInBits() == 16*Subtarget.getVectorLength()) { |
| 948 | ArrayRef<SDValue> A(Ops); |
| 949 | MVT SingleTy = typeSplit(VecTy).first; |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 950 | SDValue V0 = buildHvxVectorReg(A.take_front(Size/2), dl, SingleTy, DAG); |
| 951 | SDValue V1 = buildHvxVectorReg(A.drop_front(Size/2), dl, SingleTy, DAG); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 952 | return DAG.getNode(ISD::CONCAT_VECTORS, dl, VecTy, V0, V1); |
| 953 | } |
| 954 | |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 955 | return buildHvxVectorReg(Ops, dl, VecTy, DAG); |
| 956 | } |
| 957 | |
| 958 | SDValue |
| 959 | HexagonTargetLowering::LowerHvxConcatVectors(SDValue Op, SelectionDAG &DAG) |
| 960 | const { |
Krzysztof Parzyszek | 97a5095 | 2018-02-06 20:18:58 +0000 | [diff] [blame] | 961 | // Vector concatenation of two integer (non-bool) vectors does not need |
| 962 | // special lowering. Custom-lower concats of bool vectors and expand |
| 963 | // concats of more than 2 vectors. |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 964 | MVT VecTy = ty(Op); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 965 | const SDLoc &dl(Op); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 966 | unsigned NumOp = Op.getNumOperands(); |
Krzysztof Parzyszek | 97a5095 | 2018-02-06 20:18:58 +0000 | [diff] [blame] | 967 | if (VecTy.getVectorElementType() != MVT::i1) { |
| 968 | if (NumOp == 2) |
| 969 | return Op; |
| 970 | // Expand the other cases into a build-vector. |
| 971 | SmallVector<SDValue,8> Elems; |
| 972 | for (SDValue V : Op.getNode()->ops()) |
| 973 | DAG.ExtractVectorElements(V, Elems); |
| 974 | return DAG.getBuildVector(VecTy, dl, Elems); |
| 975 | } |
| 976 | |
| 977 | assert(VecTy.getVectorElementType() == MVT::i1); |
| 978 | unsigned HwLen = Subtarget.getVectorLength(); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 979 | assert(isPowerOf2_32(NumOp) && HwLen % NumOp == 0); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 980 | |
| 981 | SDValue Op0 = Op.getOperand(0); |
| 982 | |
| 983 | // If the operands are HVX types (i.e. not scalar predicates), then |
| 984 | // defer the concatenation, and create QCAT instead. |
| 985 | if (Subtarget.isHVXVectorType(ty(Op0), true)) { |
| 986 | if (NumOp == 2) |
| 987 | return DAG.getNode(HexagonISD::QCAT, dl, VecTy, Op0, Op.getOperand(1)); |
| 988 | |
| 989 | ArrayRef<SDUse> U(Op.getNode()->ops()); |
| 990 | SmallVector<SDValue,4> SV(U.begin(), U.end()); |
| 991 | ArrayRef<SDValue> Ops(SV); |
| 992 | |
| 993 | MVT HalfTy = typeSplit(VecTy).first; |
| 994 | SDValue V0 = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfTy, |
| 995 | Ops.take_front(NumOp/2)); |
| 996 | SDValue V1 = DAG.getNode(ISD::CONCAT_VECTORS, dl, HalfTy, |
| 997 | Ops.take_back(NumOp/2)); |
| 998 | return DAG.getNode(HexagonISD::QCAT, dl, VecTy, V0, V1); |
| 999 | } |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1000 | |
| 1001 | // Count how many bytes (in a vector register) each bit in VecTy |
| 1002 | // corresponds to. |
| 1003 | unsigned BitBytes = HwLen / VecTy.getVectorNumElements(); |
| 1004 | |
| 1005 | SmallVector<SDValue,8> Prefixes; |
| 1006 | for (SDValue V : Op.getNode()->op_values()) { |
| 1007 | SDValue P = createHvxPrefixPred(V, dl, BitBytes, true, DAG); |
| 1008 | Prefixes.push_back(P); |
| 1009 | } |
| 1010 | |
| 1011 | unsigned InpLen = ty(Op.getOperand(0)).getVectorNumElements(); |
| 1012 | MVT ByteTy = MVT::getVectorVT(MVT::i8, HwLen); |
| 1013 | SDValue S = DAG.getConstant(InpLen*BitBytes, dl, MVT::i32); |
| 1014 | SDValue Res = getZero(dl, ByteTy, DAG); |
| 1015 | for (unsigned i = 0, e = Prefixes.size(); i != e; ++i) { |
| 1016 | Res = DAG.getNode(HexagonISD::VROR, dl, ByteTy, Res, S); |
| 1017 | Res = DAG.getNode(ISD::OR, dl, ByteTy, Res, Prefixes[e-i-1]); |
| 1018 | } |
| 1019 | return DAG.getNode(HexagonISD::V2Q, dl, VecTy, Res); |
Krzysztof Parzyszek | e4ce92c | 2017-12-20 20:49:43 +0000 | [diff] [blame] | 1020 | } |
| 1021 | |
| 1022 | SDValue |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1023 | HexagonTargetLowering::LowerHvxExtractElement(SDValue Op, SelectionDAG &DAG) |
| 1024 | const { |
| 1025 | // Change the type of the extracted element to i32. |
| 1026 | SDValue VecV = Op.getOperand(0); |
| 1027 | MVT ElemTy = ty(VecV).getVectorElementType(); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1028 | const SDLoc &dl(Op); |
| 1029 | SDValue IdxV = Op.getOperand(1); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1030 | if (ElemTy == MVT::i1) |
| 1031 | return extractHvxElementPred(VecV, IdxV, dl, ty(Op), DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1032 | |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1033 | return extractHvxElementReg(VecV, IdxV, dl, ty(Op), DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1034 | } |
| 1035 | |
| 1036 | SDValue |
| 1037 | HexagonTargetLowering::LowerHvxInsertElement(SDValue Op, SelectionDAG &DAG) |
| 1038 | const { |
| 1039 | const SDLoc &dl(Op); |
| 1040 | SDValue VecV = Op.getOperand(0); |
| 1041 | SDValue ValV = Op.getOperand(1); |
| 1042 | SDValue IdxV = Op.getOperand(2); |
| 1043 | MVT ElemTy = ty(VecV).getVectorElementType(); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1044 | if (ElemTy == MVT::i1) |
| 1045 | return insertHvxElementPred(VecV, IdxV, ValV, dl, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1046 | |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1047 | return insertHvxElementReg(VecV, IdxV, ValV, dl, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1048 | } |
| 1049 | |
| 1050 | SDValue |
| 1051 | HexagonTargetLowering::LowerHvxExtractSubvector(SDValue Op, SelectionDAG &DAG) |
| 1052 | const { |
| 1053 | SDValue SrcV = Op.getOperand(0); |
| 1054 | MVT SrcTy = ty(SrcV); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1055 | MVT DstTy = ty(Op); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1056 | SDValue IdxV = Op.getOperand(1); |
| 1057 | unsigned Idx = cast<ConstantSDNode>(IdxV.getNode())->getZExtValue(); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1058 | assert(Idx % DstTy.getVectorNumElements() == 0); |
| 1059 | (void)Idx; |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1060 | const SDLoc &dl(Op); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1061 | |
| 1062 | MVT ElemTy = SrcTy.getVectorElementType(); |
| 1063 | if (ElemTy == MVT::i1) |
| 1064 | return extractHvxSubvectorPred(SrcV, IdxV, dl, DstTy, DAG); |
| 1065 | |
| 1066 | return extractHvxSubvectorReg(SrcV, IdxV, dl, DstTy, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1067 | } |
| 1068 | |
| 1069 | SDValue |
| 1070 | HexagonTargetLowering::LowerHvxInsertSubvector(SDValue Op, SelectionDAG &DAG) |
| 1071 | const { |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1072 | // Idx does not need to be a constant. |
| 1073 | SDValue VecV = Op.getOperand(0); |
| 1074 | SDValue ValV = Op.getOperand(1); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1075 | SDValue IdxV = Op.getOperand(2); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1076 | |
| 1077 | const SDLoc &dl(Op); |
Krzysztof Parzyszek | 3780a0e | 2018-01-23 17:53:59 +0000 | [diff] [blame] | 1078 | MVT VecTy = ty(VecV); |
| 1079 | MVT ElemTy = VecTy.getVectorElementType(); |
| 1080 | if (ElemTy == MVT::i1) |
| 1081 | return insertHvxSubvectorPred(VecV, ValV, IdxV, dl, DAG); |
| 1082 | |
| 1083 | return insertHvxSubvectorReg(VecV, ValV, IdxV, dl, DAG); |
Krzysztof Parzyszek | 7d37dd8 | 2017-12-06 16:40:37 +0000 | [diff] [blame] | 1084 | } |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1085 | |
| 1086 | SDValue |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 1087 | HexagonTargetLowering::LowerHvxAnyExt(SDValue Op, SelectionDAG &DAG) const { |
| 1088 | // Lower any-extends of boolean vectors to sign-extends, since they |
| 1089 | // translate directly to Q2V. Zero-extending could also be done equally |
| 1090 | // fast, but Q2V is used/recognized in more places. |
| 1091 | // For all other vectors, use zero-extend. |
| 1092 | MVT ResTy = ty(Op); |
| 1093 | SDValue InpV = Op.getOperand(0); |
| 1094 | MVT ElemTy = ty(InpV).getVectorElementType(); |
| 1095 | if (ElemTy == MVT::i1 && Subtarget.isHVXVectorType(ResTy)) |
| 1096 | return LowerHvxSignExt(Op, DAG); |
| 1097 | return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(Op), ResTy, InpV); |
| 1098 | } |
| 1099 | |
| 1100 | SDValue |
| 1101 | HexagonTargetLowering::LowerHvxSignExt(SDValue Op, SelectionDAG &DAG) const { |
| 1102 | MVT ResTy = ty(Op); |
| 1103 | SDValue InpV = Op.getOperand(0); |
| 1104 | MVT ElemTy = ty(InpV).getVectorElementType(); |
| 1105 | if (ElemTy == MVT::i1 && Subtarget.isHVXVectorType(ResTy)) |
| 1106 | return extendHvxVectorPred(InpV, SDLoc(Op), ty(Op), false, DAG); |
| 1107 | return Op; |
| 1108 | } |
| 1109 | |
| 1110 | SDValue |
| 1111 | HexagonTargetLowering::LowerHvxZeroExt(SDValue Op, SelectionDAG &DAG) const { |
| 1112 | MVT ResTy = ty(Op); |
| 1113 | SDValue InpV = Op.getOperand(0); |
| 1114 | MVT ElemTy = ty(InpV).getVectorElementType(); |
| 1115 | if (ElemTy == MVT::i1 && Subtarget.isHVXVectorType(ResTy)) |
| 1116 | return extendHvxVectorPred(InpV, SDLoc(Op), ty(Op), true, DAG); |
| 1117 | return Op; |
| 1118 | } |
| 1119 | |
| 1120 | SDValue |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1121 | HexagonTargetLowering::LowerHvxMul(SDValue Op, SelectionDAG &DAG) const { |
| 1122 | MVT ResTy = ty(Op); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1123 | assert(ResTy.isVector() && isHvxSingleTy(ResTy)); |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1124 | const SDLoc &dl(Op); |
| 1125 | SmallVector<int,256> ShuffMask; |
| 1126 | |
| 1127 | MVT ElemTy = ResTy.getVectorElementType(); |
| 1128 | unsigned VecLen = ResTy.getVectorNumElements(); |
| 1129 | SDValue Vs = Op.getOperand(0); |
| 1130 | SDValue Vt = Op.getOperand(1); |
| 1131 | |
| 1132 | switch (ElemTy.SimpleTy) { |
Krzysztof Parzyszek | 02947b7 | 2018-02-05 15:40:06 +0000 | [diff] [blame] | 1133 | case MVT::i8: { |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1134 | // For i8 vectors Vs = (a0, a1, ...), Vt = (b0, b1, ...), |
| 1135 | // V6_vmpybv Vs, Vt produces a pair of i16 vectors Hi:Lo, |
| 1136 | // where Lo = (a0*b0, a2*b2, ...), Hi = (a1*b1, a3*b3, ...). |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1137 | MVT ExtTy = typeExtElem(ResTy, 2); |
| 1138 | unsigned MpyOpc = ElemTy == MVT::i8 ? Hexagon::V6_vmpybv |
| 1139 | : Hexagon::V6_vmpyhv; |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1140 | SDValue M = getInstr(MpyOpc, dl, ExtTy, {Vs, Vt}, DAG); |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1141 | |
| 1142 | // Discard high halves of the resulting values, collect the low halves. |
| 1143 | for (unsigned I = 0; I < VecLen; I += 2) { |
| 1144 | ShuffMask.push_back(I); // Pick even element. |
| 1145 | ShuffMask.push_back(I+VecLen); // Pick odd element. |
| 1146 | } |
| 1147 | VectorPair P = opSplit(opCastElem(M, ElemTy, DAG), dl, DAG); |
Krzysztof Parzyszek | 0f5d976 | 2018-01-05 20:45:34 +0000 | [diff] [blame] | 1148 | SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG); |
| 1149 | return DAG.getBitcast(ResTy, BS); |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1150 | } |
Krzysztof Parzyszek | 02947b7 | 2018-02-05 15:40:06 +0000 | [diff] [blame] | 1151 | case MVT::i16: |
| 1152 | // For i16 there is V6_vmpyih, which acts exactly like the MUL opcode. |
| 1153 | // (There is also V6_vmpyhv, which behaves in an analogous way to |
| 1154 | // V6_vmpybv.) |
| 1155 | return getInstr(Hexagon::V6_vmpyih, dl, ResTy, {Vs, Vt}, DAG); |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1156 | case MVT::i32: { |
| 1157 | // Use the following sequence for signed word multiply: |
| 1158 | // T0 = V6_vmpyiowh Vs, Vt |
| 1159 | // T1 = V6_vaslw T0, 16 |
| 1160 | // T2 = V6_vmpyiewuh_acc T1, Vs, Vt |
| 1161 | SDValue S16 = DAG.getConstant(16, dl, MVT::i32); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1162 | SDValue T0 = getInstr(Hexagon::V6_vmpyiowh, dl, ResTy, {Vs, Vt}, DAG); |
| 1163 | SDValue T1 = getInstr(Hexagon::V6_vaslw, dl, ResTy, {T0, S16}, DAG); |
| 1164 | SDValue T2 = getInstr(Hexagon::V6_vmpyiewuh_acc, dl, ResTy, |
| 1165 | {T1, Vs, Vt}, DAG); |
Krzysztof Parzyszek | 039d4d9 | 2017-12-07 17:37:28 +0000 | [diff] [blame] | 1166 | return T2; |
| 1167 | } |
| 1168 | default: |
| 1169 | break; |
| 1170 | } |
| 1171 | return SDValue(); |
| 1172 | } |
Krzysztof Parzyszek | 4707605 | 2017-12-14 21:28:48 +0000 | [diff] [blame] | 1173 | |
| 1174 | SDValue |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1175 | HexagonTargetLowering::LowerHvxMulh(SDValue Op, SelectionDAG &DAG) const { |
| 1176 | MVT ResTy = ty(Op); |
| 1177 | assert(ResTy.isVector()); |
| 1178 | const SDLoc &dl(Op); |
| 1179 | SmallVector<int,256> ShuffMask; |
| 1180 | |
| 1181 | MVT ElemTy = ResTy.getVectorElementType(); |
| 1182 | unsigned VecLen = ResTy.getVectorNumElements(); |
| 1183 | SDValue Vs = Op.getOperand(0); |
| 1184 | SDValue Vt = Op.getOperand(1); |
| 1185 | bool IsSigned = Op.getOpcode() == ISD::MULHS; |
| 1186 | |
| 1187 | if (ElemTy == MVT::i8 || ElemTy == MVT::i16) { |
| 1188 | // For i8 vectors Vs = (a0, a1, ...), Vt = (b0, b1, ...), |
| 1189 | // V6_vmpybv Vs, Vt produces a pair of i16 vectors Hi:Lo, |
| 1190 | // where Lo = (a0*b0, a2*b2, ...), Hi = (a1*b1, a3*b3, ...). |
| 1191 | // For i16, use V6_vmpyhv, which behaves in an analogous way to |
| 1192 | // V6_vmpybv: results Lo and Hi are products of even/odd elements |
| 1193 | // respectively. |
| 1194 | MVT ExtTy = typeExtElem(ResTy, 2); |
| 1195 | unsigned MpyOpc = ElemTy == MVT::i8 |
| 1196 | ? (IsSigned ? Hexagon::V6_vmpybv : Hexagon::V6_vmpyubv) |
| 1197 | : (IsSigned ? Hexagon::V6_vmpyhv : Hexagon::V6_vmpyuhv); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1198 | SDValue M = getInstr(MpyOpc, dl, ExtTy, {Vs, Vt}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1199 | |
| 1200 | // Discard low halves of the resulting values, collect the high halves. |
| 1201 | for (unsigned I = 0; I < VecLen; I += 2) { |
| 1202 | ShuffMask.push_back(I+1); // Pick even element. |
| 1203 | ShuffMask.push_back(I+VecLen+1); // Pick odd element. |
| 1204 | } |
| 1205 | VectorPair P = opSplit(opCastElem(M, ElemTy, DAG), dl, DAG); |
| 1206 | SDValue BS = getByteShuffle(dl, P.first, P.second, ShuffMask, DAG); |
| 1207 | return DAG.getBitcast(ResTy, BS); |
| 1208 | } |
| 1209 | |
| 1210 | assert(ElemTy == MVT::i32); |
| 1211 | SDValue S16 = DAG.getConstant(16, dl, MVT::i32); |
| 1212 | |
| 1213 | if (IsSigned) { |
| 1214 | // mulhs(Vs,Vt) = |
| 1215 | // = [(Hi(Vs)*2^16 + Lo(Vs)) *s (Hi(Vt)*2^16 + Lo(Vt))] >> 32 |
| 1216 | // = [Hi(Vs)*2^16 *s Hi(Vt)*2^16 + Hi(Vs) *su Lo(Vt)*2^16 |
| 1217 | // + Lo(Vs) *us (Hi(Vt)*2^16 + Lo(Vt))] >> 32 |
| 1218 | // = [Hi(Vs) *s Hi(Vt)*2^32 + Hi(Vs) *su Lo(Vt)*2^16 |
| 1219 | // + Lo(Vs) *us Vt] >> 32 |
| 1220 | // The low half of Lo(Vs)*Lo(Vt) will be discarded (it's not added to |
| 1221 | // anything, so it cannot produce any carry over to higher bits), |
| 1222 | // so everything in [] can be shifted by 16 without loss of precision. |
| 1223 | // = [Hi(Vs) *s Hi(Vt)*2^16 + Hi(Vs)*su Lo(Vt) + Lo(Vs)*Vt >> 16] >> 16 |
| 1224 | // = [Hi(Vs) *s Hi(Vt)*2^16 + Hi(Vs)*su Lo(Vt) + V6_vmpyewuh(Vs,Vt)] >> 16 |
| 1225 | // Denote Hi(Vs) = Vs': |
| 1226 | // = [Vs'*s Hi(Vt)*2^16 + Vs' *su Lo(Vt) + V6_vmpyewuh(Vt,Vs)] >> 16 |
| 1227 | // = Vs'*s Hi(Vt) + (V6_vmpyiewuh(Vs',Vt) + V6_vmpyewuh(Vt,Vs)) >> 16 |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1228 | SDValue T0 = getInstr(Hexagon::V6_vmpyewuh, dl, ResTy, {Vt, Vs}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1229 | // Get Vs': |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1230 | SDValue S0 = getInstr(Hexagon::V6_vasrw, dl, ResTy, {Vs, S16}, DAG); |
| 1231 | SDValue T1 = getInstr(Hexagon::V6_vmpyiewuh_acc, dl, ResTy, |
| 1232 | {T0, S0, Vt}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1233 | // Shift by 16: |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1234 | SDValue S2 = getInstr(Hexagon::V6_vasrw, dl, ResTy, {T1, S16}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1235 | // Get Vs'*Hi(Vt): |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1236 | SDValue T2 = getInstr(Hexagon::V6_vmpyiowh, dl, ResTy, {S0, Vt}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1237 | // Add: |
| 1238 | SDValue T3 = DAG.getNode(ISD::ADD, dl, ResTy, {S2, T2}); |
| 1239 | return T3; |
| 1240 | } |
| 1241 | |
| 1242 | // Unsigned mulhw. (Would expansion using signed mulhw be better?) |
| 1243 | |
| 1244 | auto LoVec = [&DAG,ResTy,dl] (SDValue Pair) { |
| 1245 | return DAG.getTargetExtractSubreg(Hexagon::vsub_lo, dl, ResTy, Pair); |
| 1246 | }; |
| 1247 | auto HiVec = [&DAG,ResTy,dl] (SDValue Pair) { |
| 1248 | return DAG.getTargetExtractSubreg(Hexagon::vsub_hi, dl, ResTy, Pair); |
| 1249 | }; |
| 1250 | |
| 1251 | MVT PairTy = typeJoin({ResTy, ResTy}); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1252 | SDValue P = getInstr(Hexagon::V6_lvsplatw, dl, ResTy, |
| 1253 | {DAG.getConstant(0x02020202, dl, MVT::i32)}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1254 | // Multiply-unsigned halfwords: |
| 1255 | // LoVec = Vs.uh[2i] * Vt.uh[2i], |
| 1256 | // HiVec = Vs.uh[2i+1] * Vt.uh[2i+1] |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1257 | SDValue T0 = getInstr(Hexagon::V6_vmpyuhv, dl, PairTy, {Vs, Vt}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1258 | // The low halves in the LoVec of the pair can be discarded. They are |
| 1259 | // not added to anything (in the full-precision product), so they cannot |
| 1260 | // produce a carry into the higher bits. |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1261 | SDValue T1 = getInstr(Hexagon::V6_vlsrw, dl, ResTy, {LoVec(T0), S16}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1262 | // Swap low and high halves in Vt, and do the halfword multiplication |
| 1263 | // to get products Vs.uh[2i] * Vt.uh[2i+1] and Vs.uh[2i+1] * Vt.uh[2i]. |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1264 | SDValue D0 = getInstr(Hexagon::V6_vdelta, dl, ResTy, {Vt, P}, DAG); |
| 1265 | SDValue T2 = getInstr(Hexagon::V6_vmpyuhv, dl, PairTy, {Vs, D0}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1266 | // T2 has mixed products of halfwords: Lo(Vt)*Hi(Vs) and Hi(Vt)*Lo(Vs). |
| 1267 | // These products are words, but cannot be added directly because the |
| 1268 | // sums could overflow. Add these products, by halfwords, where each sum |
| 1269 | // of a pair of halfwords gives a word. |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1270 | SDValue T3 = getInstr(Hexagon::V6_vadduhw, dl, PairTy, |
| 1271 | {LoVec(T2), HiVec(T2)}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1272 | // Add the high halfwords from the products of the low halfwords. |
| 1273 | SDValue T4 = DAG.getNode(ISD::ADD, dl, ResTy, {T1, LoVec(T3)}); |
Krzysztof Parzyszek | 15efa98 | 2018-01-31 21:17:03 +0000 | [diff] [blame] | 1274 | SDValue T5 = getInstr(Hexagon::V6_vlsrw, dl, ResTy, {T4, S16}, DAG); |
Krzysztof Parzyszek | 7fb738a | 2018-01-15 18:43:55 +0000 | [diff] [blame] | 1275 | SDValue T6 = DAG.getNode(ISD::ADD, dl, ResTy, {HiVec(T0), HiVec(T3)}); |
| 1276 | SDValue T7 = DAG.getNode(ISD::ADD, dl, ResTy, {T5, T6}); |
| 1277 | return T7; |
| 1278 | } |
| 1279 | |
| 1280 | SDValue |
Krzysztof Parzyszek | 6b589e5 | 2017-12-18 18:32:27 +0000 | [diff] [blame] | 1281 | HexagonTargetLowering::LowerHvxExtend(SDValue Op, SelectionDAG &DAG) const { |
| 1282 | // Sign- and zero-extends are legal. |
| 1283 | assert(Op.getOpcode() == ISD::ANY_EXTEND_VECTOR_INREG); |
| 1284 | return DAG.getZeroExtendVectorInReg(Op.getOperand(0), SDLoc(Op), ty(Op)); |
| 1285 | } |
Krzysztof Parzyszek | 1108ee2 | 2018-01-31 20:49:24 +0000 | [diff] [blame] | 1286 | |
| 1287 | SDValue |
| 1288 | HexagonTargetLowering::LowerHvxShift(SDValue Op, SelectionDAG &DAG) const { |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 1289 | if (SDValue S = getVectorShiftByInt(Op, DAG)) |
| 1290 | return S; |
Krzysztof Parzyszek | 1108ee2 | 2018-01-31 20:49:24 +0000 | [diff] [blame] | 1291 | return Op; |
| 1292 | } |
| 1293 | |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1294 | SDValue |
| 1295 | HexagonTargetLowering::SplitHvxPairOp(SDValue Op, SelectionDAG &DAG) const { |
| 1296 | assert(!Op.isMachineOpcode()); |
| 1297 | SmallVector<SDValue,2> OpsL, OpsH; |
| 1298 | const SDLoc &dl(Op); |
| 1299 | |
| 1300 | auto SplitVTNode = [&DAG,this] (const VTSDNode *N) { |
| 1301 | MVT Ty = typeSplit(N->getVT().getSimpleVT()).first; |
| 1302 | SDValue TV = DAG.getValueType(Ty); |
| 1303 | return std::make_pair(TV, TV); |
| 1304 | }; |
| 1305 | |
| 1306 | for (SDValue A : Op.getNode()->ops()) { |
| 1307 | VectorPair P = Subtarget.isHVXVectorType(ty(A), true) |
| 1308 | ? opSplit(A, dl, DAG) |
| 1309 | : std::make_pair(A, A); |
| 1310 | // Special case for type operand. |
| 1311 | if (Op.getOpcode() == ISD::SIGN_EXTEND_INREG) { |
| 1312 | if (const auto *N = dyn_cast<const VTSDNode>(A.getNode())) |
| 1313 | P = SplitVTNode(N); |
| 1314 | } |
| 1315 | OpsL.push_back(P.first); |
| 1316 | OpsH.push_back(P.second); |
| 1317 | } |
| 1318 | |
| 1319 | MVT ResTy = ty(Op); |
| 1320 | MVT HalfTy = typeSplit(ResTy).first; |
| 1321 | SDValue L = DAG.getNode(Op.getOpcode(), dl, HalfTy, OpsL); |
| 1322 | SDValue H = DAG.getNode(Op.getOpcode(), dl, HalfTy, OpsH); |
| 1323 | SDValue S = DAG.getNode(ISD::CONCAT_VECTORS, dl, ResTy, L, H); |
| 1324 | return S; |
| 1325 | } |
| 1326 | |
| 1327 | SDValue |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1328 | HexagonTargetLowering::SplitHvxMemOp(SDValue Op, SelectionDAG &DAG) const { |
| 1329 | LSBaseSDNode *BN = cast<LSBaseSDNode>(Op.getNode()); |
| 1330 | assert(BN->isUnindexed()); |
| 1331 | MVT MemTy = BN->getMemoryVT().getSimpleVT(); |
| 1332 | if (!isHvxPairTy(MemTy)) |
| 1333 | return Op; |
| 1334 | |
| 1335 | const SDLoc &dl(Op); |
| 1336 | unsigned HwLen = Subtarget.getVectorLength(); |
| 1337 | MVT SingleTy = typeSplit(MemTy).first; |
| 1338 | SDValue Chain = BN->getChain(); |
| 1339 | SDValue Base0 = BN->getBasePtr(); |
| 1340 | SDValue Base1 = DAG.getMemBasePlusOffset(Base0, HwLen, dl); |
| 1341 | |
| 1342 | MachineMemOperand *MOp0 = nullptr, *MOp1 = nullptr; |
| 1343 | if (MachineMemOperand *MMO = BN->getMemOperand()) { |
| 1344 | MachineFunction &MF = DAG.getMachineFunction(); |
| 1345 | MOp0 = MF.getMachineMemOperand(MMO, 0, HwLen); |
| 1346 | MOp1 = MF.getMachineMemOperand(MMO, HwLen, HwLen); |
| 1347 | } |
| 1348 | |
| 1349 | unsigned MemOpc = BN->getOpcode(); |
| 1350 | SDValue NewOp; |
| 1351 | |
| 1352 | if (MemOpc == ISD::LOAD) { |
| 1353 | SDValue Load0 = DAG.getLoad(SingleTy, dl, Chain, Base0, MOp0); |
| 1354 | SDValue Load1 = DAG.getLoad(SingleTy, dl, Chain, Base1, MOp1); |
| 1355 | NewOp = DAG.getMergeValues( |
| 1356 | { DAG.getNode(ISD::CONCAT_VECTORS, dl, MemTy, Load0, Load1), |
| 1357 | DAG.getNode(ISD::TokenFactor, dl, MVT::Other, |
| 1358 | Load0.getValue(1), Load1.getValue(1)) }, dl); |
| 1359 | } else { |
| 1360 | assert(MemOpc == ISD::STORE); |
| 1361 | VectorPair Vals = opSplit(cast<StoreSDNode>(Op)->getValue(), dl, DAG); |
| 1362 | SDValue Store0 = DAG.getStore(Chain, dl, Vals.first, Base0, MOp0); |
| 1363 | SDValue Store1 = DAG.getStore(Chain, dl, Vals.second, Base1, MOp1); |
| 1364 | NewOp = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Store0, Store1); |
| 1365 | } |
| 1366 | |
| 1367 | return NewOp; |
| 1368 | } |
| 1369 | |
| 1370 | SDValue |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1371 | HexagonTargetLowering::LowerHvxOperation(SDValue Op, SelectionDAG &DAG) const { |
| 1372 | unsigned Opc = Op.getOpcode(); |
| 1373 | bool IsPairOp = isHvxPairTy(ty(Op)) || |
| 1374 | llvm::any_of(Op.getNode()->ops(), [this] (SDValue V) { |
| 1375 | return isHvxPairTy(ty(V)); |
| 1376 | }); |
| 1377 | |
| 1378 | if (IsPairOp) { |
| 1379 | switch (Opc) { |
| 1380 | default: |
| 1381 | break; |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1382 | case ISD::LOAD: |
| 1383 | case ISD::STORE: |
| 1384 | return SplitHvxMemOp(Op, DAG); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1385 | case ISD::MUL: |
| 1386 | case ISD::MULHS: |
| 1387 | case ISD::MULHU: |
| 1388 | case ISD::AND: |
| 1389 | case ISD::OR: |
| 1390 | case ISD::XOR: |
| 1391 | case ISD::SRA: |
| 1392 | case ISD::SHL: |
| 1393 | case ISD::SRL: |
| 1394 | case ISD::SETCC: |
| 1395 | case ISD::VSELECT: |
| 1396 | case ISD::SIGN_EXTEND_INREG: |
| 1397 | return SplitHvxPairOp(Op, DAG); |
| 1398 | } |
| 1399 | } |
| 1400 | |
| 1401 | switch (Opc) { |
| 1402 | default: |
| 1403 | break; |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1404 | case ISD::BUILD_VECTOR: return LowerHvxBuildVector(Op, DAG); |
| 1405 | case ISD::CONCAT_VECTORS: return LowerHvxConcatVectors(Op, DAG); |
| 1406 | case ISD::INSERT_SUBVECTOR: return LowerHvxInsertSubvector(Op, DAG); |
| 1407 | case ISD::INSERT_VECTOR_ELT: return LowerHvxInsertElement(Op, DAG); |
| 1408 | case ISD::EXTRACT_SUBVECTOR: return LowerHvxExtractSubvector(Op, DAG); |
| 1409 | case ISD::EXTRACT_VECTOR_ELT: return LowerHvxExtractElement(Op, DAG); |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 1410 | |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1411 | case ISD::ANY_EXTEND: return LowerHvxAnyExt(Op, DAG); |
| 1412 | case ISD::SIGN_EXTEND: return LowerHvxSignExt(Op, DAG); |
| 1413 | case ISD::ZERO_EXTEND: return LowerHvxZeroExt(Op, DAG); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1414 | case ISD::SRA: |
| 1415 | case ISD::SHL: |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1416 | case ISD::SRL: return LowerHvxShift(Op, DAG); |
| 1417 | case ISD::MUL: return LowerHvxMul(Op, DAG); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1418 | case ISD::MULHS: |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1419 | case ISD::MULHU: return LowerHvxMulh(Op, DAG); |
| 1420 | case ISD::ANY_EXTEND_VECTOR_INREG: return LowerHvxExtend(Op, DAG); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1421 | case ISD::SETCC: |
Krzysztof Parzyszek | ad83ce4 | 2018-02-14 20:46:06 +0000 | [diff] [blame] | 1422 | case ISD::INTRINSIC_VOID: return Op; |
Krzysztof Parzyszek | 2c3edf0 | 2018-03-07 17:27:18 +0000 | [diff] [blame^] | 1423 | // Unaligned loads will be handled by the default lowering. |
| 1424 | case ISD::LOAD: return SDValue(); |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1425 | } |
| 1426 | #ifndef NDEBUG |
| 1427 | Op.dumpr(&DAG); |
| 1428 | #endif |
| 1429 | llvm_unreachable("Unhandled HVX operation"); |
| 1430 | } |
| 1431 | |
| 1432 | bool |
| 1433 | HexagonTargetLowering::isHvxOperation(SDValue Op) const { |
| 1434 | // If the type of the result, or any operand type are HVX vector types, |
| 1435 | // this is an HVX operation. |
Krzysztof Parzyszek | 8abaf89 | 2018-02-06 20:22:20 +0000 | [diff] [blame] | 1436 | return Subtarget.isHVXVectorType(ty(Op), true) || |
Krzysztof Parzyszek | 88f1100 | 2018-02-06 14:24:57 +0000 | [diff] [blame] | 1437 | llvm::any_of(Op.getNode()->ops(), |
| 1438 | [this] (SDValue V) { |
| 1439 | return Subtarget.isHVXVectorType(ty(V), true); |
| 1440 | }); |
| 1441 | } |