blob: e0d7bca9a94b9e0f4adb008868e086b365f4849d [file] [log] [blame]
Richard Sandifordd131ff82013-07-08 09:35:23 +00001//===-- SystemZSelectionDAGInfo.cpp - SystemZ SelectionDAG Info -----------===//
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 the SystemZSelectionDAGInfo class.
11//
12//===----------------------------------------------------------------------===//
13
Richard Sandifordd131ff82013-07-08 09:35:23 +000014#include "SystemZTargetMachine.h"
15#include "llvm/CodeGen/SelectionDAG.h"
16
17using namespace llvm;
18
Chandler Carruth84e68b22014-04-22 02:41:26 +000019#define DEBUG_TYPE "systemz-selectiondag-info"
20
Richard Sandiford4943bc32013-09-06 10:25:07 +000021// Decide whether it is best to use a loop or straight-line code for
22// a block operation of Size bytes with source address Src and destination
23// address Dest. Sequence is the opcode to use for straight-line code
24// (such as MVC) and Loop is the opcode to use for loops (such as MVC_LOOP).
25// Return the chain for the completed operation.
Benjamin Kramerbdc49562016-06-12 15:39:02 +000026static SDValue emitMemMem(SelectionDAG &DAG, const SDLoc &DL, unsigned Sequence,
Richard Sandiford4943bc32013-09-06 10:25:07 +000027 unsigned Loop, SDValue Chain, SDValue Dst,
28 SDValue Src, uint64_t Size) {
Richard Sandiford5e318f02013-08-27 09:54:29 +000029 EVT PtrVT = Src.getValueType();
30 // The heuristic we use is to prefer loops for anything that would
31 // require 7 or more MVCs. With these kinds of sizes there isn't
32 // much to choose between straight-line code and looping code,
33 // since the time will be dominated by the MVCs themselves.
34 // However, the loop has 4 or 5 instructions (depending on whether
35 // the base addresses can be proved equal), so there doesn't seem
36 // much point using a loop for 5 * 256 bytes or fewer. Anything in
37 // the range (5 * 256, 6 * 256) will need another instruction after
38 // the loop, so it doesn't seem worth using a loop then either.
39 // The next value up, 6 * 256, can be implemented in the same
40 // number of straight-line MVCs as 6 * 256 - 1.
41 if (Size > 6 * 256)
Richard Sandiford4943bc32013-09-06 10:25:07 +000042 return DAG.getNode(Loop, DL, MVT::Other, Chain, Dst, Src,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +000043 DAG.getConstant(Size, DL, PtrVT),
44 DAG.getConstant(Size / 256, DL, PtrVT));
Richard Sandiford4943bc32013-09-06 10:25:07 +000045 return DAG.getNode(Sequence, DL, MVT::Other, Chain, Dst, Src,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +000046 DAG.getConstant(Size, DL, PtrVT));
Richard Sandiford5e318f02013-08-27 09:54:29 +000047}
48
Benjamin Kramerbdc49562016-06-12 15:39:02 +000049SDValue SystemZSelectionDAGInfo::EmitTargetCodeForMemcpy(
50 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dst, SDValue Src,
51 SDValue Size, unsigned Align, bool IsVolatile, bool AlwaysInline,
52 MachinePointerInfo DstPtrInfo, MachinePointerInfo SrcPtrInfo) const {
Richard Sandifordd131ff82013-07-08 09:35:23 +000053 if (IsVolatile)
54 return SDValue();
55
Richard Sandiford21f5d682014-03-06 11:22:58 +000056 if (auto *CSize = dyn_cast<ConstantSDNode>(Size))
Richard Sandiford4943bc32013-09-06 10:25:07 +000057 return emitMemMem(DAG, DL, SystemZISD::MVC, SystemZISD::MVC_LOOP,
58 Chain, Dst, Src, CSize->getZExtValue());
Richard Sandifordd131ff82013-07-08 09:35:23 +000059 return SDValue();
60}
Richard Sandiford47660c12013-07-09 09:32:42 +000061
62// Handle a memset of 1, 2, 4 or 8 bytes with the operands given by
63// Chain, Dst, ByteVal and Size. These cases are expected to use
64// MVI, MVHHI, MVHI and MVGHI respectively.
Benjamin Kramerbdc49562016-06-12 15:39:02 +000065static SDValue memsetStore(SelectionDAG &DAG, const SDLoc &DL, SDValue Chain,
Richard Sandiford47660c12013-07-09 09:32:42 +000066 SDValue Dst, uint64_t ByteVal, uint64_t Size,
Benjamin Kramerbdc49562016-06-12 15:39:02 +000067 unsigned Align, MachinePointerInfo DstPtrInfo) {
Richard Sandiford47660c12013-07-09 09:32:42 +000068 uint64_t StoreVal = ByteVal;
69 for (unsigned I = 1; I < Size; ++I)
70 StoreVal |= ByteVal << (I * 8);
Justin Lebar9c375812016-07-15 18:27:10 +000071 return DAG.getStore(
72 Chain, DL, DAG.getConstant(StoreVal, DL, MVT::getIntegerVT(Size * 8)),
73 Dst, DstPtrInfo, Align);
Richard Sandiford47660c12013-07-09 09:32:42 +000074}
75
Benjamin Kramerbdc49562016-06-12 15:39:02 +000076SDValue SystemZSelectionDAGInfo::EmitTargetCodeForMemset(
77 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dst,
78 SDValue Byte, SDValue Size, unsigned Align, bool IsVolatile,
79 MachinePointerInfo DstPtrInfo) const {
Richard Sandiford5e318f02013-08-27 09:54:29 +000080 EVT PtrVT = Dst.getValueType();
Richard Sandiford47660c12013-07-09 09:32:42 +000081
82 if (IsVolatile)
83 return SDValue();
84
Richard Sandiford21f5d682014-03-06 11:22:58 +000085 if (auto *CSize = dyn_cast<ConstantSDNode>(Size)) {
Richard Sandiford47660c12013-07-09 09:32:42 +000086 uint64_t Bytes = CSize->getZExtValue();
87 if (Bytes == 0)
88 return SDValue();
Richard Sandiford21f5d682014-03-06 11:22:58 +000089 if (auto *CByte = dyn_cast<ConstantSDNode>(Byte)) {
Richard Sandiford47660c12013-07-09 09:32:42 +000090 // Handle cases that can be done using at most two of
91 // MVI, MVHI, MVHHI and MVGHI. The latter two can only be
92 // used if ByteVal is all zeros or all ones; in other casees,
93 // we can move at most 2 halfwords.
94 uint64_t ByteVal = CByte->getZExtValue();
95 if (ByteVal == 0 || ByteVal == 255 ?
Benjamin Kramer5f6a9072015-02-12 15:35:40 +000096 Bytes <= 16 && countPopulation(Bytes) <= 2 :
Richard Sandiford47660c12013-07-09 09:32:42 +000097 Bytes <= 4) {
98 unsigned Size1 = Bytes == 16 ? 8 : 1 << findLastSet(Bytes);
99 unsigned Size2 = Bytes - Size1;
100 SDValue Chain1 = memsetStore(DAG, DL, Chain, Dst, ByteVal, Size1,
101 Align, DstPtrInfo);
102 if (Size2 == 0)
103 return Chain1;
Richard Sandiford5e318f02013-08-27 09:54:29 +0000104 Dst = DAG.getNode(ISD::ADD, DL, PtrVT, Dst,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000105 DAG.getConstant(Size1, DL, PtrVT));
Richard Sandiford47660c12013-07-09 09:32:42 +0000106 DstPtrInfo = DstPtrInfo.getWithOffset(Size1);
107 SDValue Chain2 = memsetStore(DAG, DL, Chain, Dst, ByteVal, Size2,
108 std::min(Align, Size1), DstPtrInfo);
109 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chain1, Chain2);
110 }
111 } else {
112 // Handle one and two bytes using STC.
113 if (Bytes <= 2) {
Justin Lebar9c375812016-07-15 18:27:10 +0000114 SDValue Chain1 = DAG.getStore(Chain, DL, Byte, Dst, DstPtrInfo, Align);
Richard Sandiford47660c12013-07-09 09:32:42 +0000115 if (Bytes == 1)
116 return Chain1;
Richard Sandiford5e318f02013-08-27 09:54:29 +0000117 SDValue Dst2 = DAG.getNode(ISD::ADD, DL, PtrVT, Dst,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000118 DAG.getConstant(1, DL, PtrVT));
Justin Lebar9c375812016-07-15 18:27:10 +0000119 SDValue Chain2 =
120 DAG.getStore(Chain, DL, Byte, Dst2, DstPtrInfo.getWithOffset(1),
121 /* Alignment = */ 1);
Richard Sandiford47660c12013-07-09 09:32:42 +0000122 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chain1, Chain2);
123 }
124 }
125 assert(Bytes >= 2 && "Should have dealt with 0- and 1-byte cases already");
Richard Sandiford4943bc32013-09-06 10:25:07 +0000126
127 // Handle the special case of a memset of 0, which can use XC.
Richard Sandiford21f5d682014-03-06 11:22:58 +0000128 auto *CByte = dyn_cast<ConstantSDNode>(Byte);
Richard Sandiford4943bc32013-09-06 10:25:07 +0000129 if (CByte && CByte->getZExtValue() == 0)
130 return emitMemMem(DAG, DL, SystemZISD::XC, SystemZISD::XC_LOOP,
131 Chain, Dst, Dst, Bytes);
132
Richard Sandiford5e318f02013-08-27 09:54:29 +0000133 // Copy the byte to the first location and then use MVC to copy
134 // it to the rest.
Justin Lebar9c375812016-07-15 18:27:10 +0000135 Chain = DAG.getStore(Chain, DL, Byte, Dst, DstPtrInfo, Align);
Richard Sandiford5e318f02013-08-27 09:54:29 +0000136 SDValue DstPlus1 = DAG.getNode(ISD::ADD, DL, PtrVT, Dst,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000137 DAG.getConstant(1, DL, PtrVT));
Richard Sandiford4943bc32013-09-06 10:25:07 +0000138 return emitMemMem(DAG, DL, SystemZISD::MVC, SystemZISD::MVC_LOOP,
139 Chain, DstPlus1, Dst, Bytes - 1);
Richard Sandiford47660c12013-07-09 09:32:42 +0000140 }
141 return SDValue();
142}
Richard Sandiford564681c2013-08-12 10:28:10 +0000143
Richard Sandifordbe133a82013-08-28 09:01:51 +0000144// Use CLC to compare [Src1, Src1 + Size) with [Src2, Src2 + Size),
145// deciding whether to use a loop or straight-line code.
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000146static SDValue emitCLC(SelectionDAG &DAG, const SDLoc &DL, SDValue Chain,
Richard Sandifordbe133a82013-08-28 09:01:51 +0000147 SDValue Src1, SDValue Src2, uint64_t Size) {
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000148 SDVTList VTs = DAG.getVTList(MVT::i32, MVT::Other);
Richard Sandifordbe133a82013-08-28 09:01:51 +0000149 EVT PtrVT = Src1.getValueType();
150 // A two-CLC sequence is a clear win over a loop, not least because it
151 // needs only one branch. A three-CLC sequence needs the same number
152 // of branches as a loop (i.e. 2), but is shorter. That brings us to
153 // lengths greater than 768 bytes. It seems relatively likely that
154 // a difference will be found within the first 768 bytes, so we just
155 // optimize for the smallest number of branch instructions, in order
156 // to avoid polluting the prediction buffer too much. A loop only ever
157 // needs 2 branches, whereas a straight-line sequence would need 3 or more.
158 if (Size > 3 * 256)
159 return DAG.getNode(SystemZISD::CLC_LOOP, DL, VTs, Chain, Src1, Src2,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000160 DAG.getConstant(Size, DL, PtrVT),
161 DAG.getConstant(Size / 256, DL, PtrVT));
Richard Sandifordbe133a82013-08-28 09:01:51 +0000162 return DAG.getNode(SystemZISD::CLC, DL, VTs, Chain, Src1, Src2,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000163 DAG.getConstant(Size, DL, PtrVT));
Richard Sandifordbe133a82013-08-28 09:01:51 +0000164}
165
Richard Sandifordca232712013-08-16 11:21:54 +0000166// Convert the current CC value into an integer that is 0 if CC == 0,
167// less than zero if CC == 1 and greater than zero if CC >= 2.
168// The sequence starts with IPM, which puts CC into bits 29 and 28
169// of an integer and clears bits 30 and 31.
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000170static SDValue addIPMSequence(const SDLoc &DL, SDValue CCReg,
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000171 SelectionDAG &DAG) {
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000172 SDValue IPM = DAG.getNode(SystemZISD::IPM, DL, MVT::i32, CCReg);
Richard Sandifordca232712013-08-16 11:21:54 +0000173 SDValue SRL = DAG.getNode(ISD::SRL, DL, MVT::i32, IPM,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000174 DAG.getConstant(SystemZ::IPM_CC, DL, MVT::i32));
Richard Sandifordca232712013-08-16 11:21:54 +0000175 SDValue ROTL = DAG.getNode(ISD::ROTL, DL, MVT::i32, SRL,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000176 DAG.getConstant(31, DL, MVT::i32));
Richard Sandifordca232712013-08-16 11:21:54 +0000177 return ROTL;
178}
179
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000180std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemcmp(
181 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src1,
182 SDValue Src2, SDValue Size, MachinePointerInfo Op1PtrInfo,
183 MachinePointerInfo Op2PtrInfo) const {
Richard Sandiford21f5d682014-03-06 11:22:58 +0000184 if (auto *CSize = dyn_cast<ConstantSDNode>(Size)) {
Richard Sandiford564681c2013-08-12 10:28:10 +0000185 uint64_t Bytes = CSize->getZExtValue();
Richard Sandifordbe133a82013-08-28 09:01:51 +0000186 assert(Bytes > 0 && "Caller should have handled 0-size case");
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000187 SDValue CCReg = emitCLC(DAG, DL, Chain, Src1, Src2, Bytes);
188 Chain = CCReg.getValue(1);
189 return std::make_pair(addIPMSequence(DL, CCReg, DAG), Chain);
Richard Sandiford564681c2013-08-12 10:28:10 +0000190 }
191 return std::make_pair(SDValue(), SDValue());
192}
Richard Sandifordca232712013-08-16 11:21:54 +0000193
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000194std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemchr(
195 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src,
196 SDValue Char, SDValue Length, MachinePointerInfo SrcPtrInfo) const {
Richard Sandiford6f6d5512013-08-20 09:38:48 +0000197 // Use SRST to find the character. End is its address on success.
198 EVT PtrVT = Src.getValueType();
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000199 SDVTList VTs = DAG.getVTList(PtrVT, MVT::i32, MVT::Other);
Richard Sandiford6f6d5512013-08-20 09:38:48 +0000200 Length = DAG.getZExtOrTrunc(Length, DL, PtrVT);
201 Char = DAG.getZExtOrTrunc(Char, DL, MVT::i32);
202 Char = DAG.getNode(ISD::AND, DL, MVT::i32, Char,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000203 DAG.getConstant(255, DL, MVT::i32));
Richard Sandiford6f6d5512013-08-20 09:38:48 +0000204 SDValue Limit = DAG.getNode(ISD::ADD, DL, PtrVT, Src, Length);
205 SDValue End = DAG.getNode(SystemZISD::SEARCH_STRING, DL, VTs, Chain,
206 Limit, Src, Char);
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000207 SDValue CCReg = End.getValue(1);
208 Chain = End.getValue(2);
Richard Sandiford6f6d5512013-08-20 09:38:48 +0000209
210 // Now select between End and null, depending on whether the character
211 // was found.
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000212 SDValue Ops[] = {End, DAG.getConstant(0, DL, PtrVT),
213 DAG.getConstant(SystemZ::CCMASK_SRST, DL, MVT::i32),
214 DAG.getConstant(SystemZ::CCMASK_SRST_FOUND, DL, MVT::i32),
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000215 CCReg};
216 End = DAG.getNode(SystemZISD::SELECT_CCMASK, DL, PtrVT, Ops);
Richard Sandiford6f6d5512013-08-20 09:38:48 +0000217 return std::make_pair(End, Chain);
218}
219
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000220std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcpy(
221 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dest,
222 SDValue Src, MachinePointerInfo DestPtrInfo, MachinePointerInfo SrcPtrInfo,
223 bool isStpcpy) const {
Richard Sandifordbb83a502013-08-16 11:29:37 +0000224 SDVTList VTs = DAG.getVTList(Dest.getValueType(), MVT::Other);
225 SDValue EndDest = DAG.getNode(SystemZISD::STPCPY, DL, VTs, Chain, Dest, Src,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000226 DAG.getConstant(0, DL, MVT::i32));
Richard Sandifordbb83a502013-08-16 11:29:37 +0000227 return std::make_pair(isStpcpy ? EndDest : Dest, EndDest.getValue(1));
228}
229
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000230std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcmp(
231 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src1,
232 SDValue Src2, MachinePointerInfo Op1PtrInfo,
233 MachinePointerInfo Op2PtrInfo) const {
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000234 SDVTList VTs = DAG.getVTList(Src1.getValueType(), MVT::i32, MVT::Other);
Richard Sandifordca232712013-08-16 11:21:54 +0000235 SDValue Unused = DAG.getNode(SystemZISD::STRCMP, DL, VTs, Chain, Src1, Src2,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000236 DAG.getConstant(0, DL, MVT::i32));
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000237 SDValue CCReg = Unused.getValue(1);
238 Chain = Unused.getValue(2);
239 return std::make_pair(addIPMSequence(DL, CCReg, DAG), Chain);
Richard Sandifordca232712013-08-16 11:21:54 +0000240}
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000241
242// Search from Src for a null character, stopping once Src reaches Limit.
243// Return a pair of values, the first being the number of nonnull characters
244// and the second being the out chain.
245//
246// This can be used for strlen by setting Limit to 0.
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000247static std::pair<SDValue, SDValue> getBoundedStrlen(SelectionDAG &DAG,
248 const SDLoc &DL,
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000249 SDValue Chain, SDValue Src,
250 SDValue Limit) {
251 EVT PtrVT = Src.getValueType();
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000252 SDVTList VTs = DAG.getVTList(PtrVT, MVT::i32, MVT::Other);
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000253 SDValue End = DAG.getNode(SystemZISD::SEARCH_STRING, DL, VTs, Chain,
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000254 Limit, Src, DAG.getConstant(0, DL, MVT::i32));
Ulrich Weigandb32f3652018-04-30 17:52:32 +0000255 Chain = End.getValue(2);
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000256 SDValue Len = DAG.getNode(ISD::SUB, DL, PtrVT, End, Src);
257 return std::make_pair(Len, Chain);
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000258}
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000259
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000260std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrlen(
261 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src,
262 MachinePointerInfo SrcPtrInfo) const {
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000263 EVT PtrVT = Src.getValueType();
Sergey Dmitrouk842a51b2015-04-28 14:05:47 +0000264 return getBoundedStrlen(DAG, DL, Chain, Src, DAG.getConstant(0, DL, PtrVT));
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000265}
266
Benjamin Kramerbdc49562016-06-12 15:39:02 +0000267std::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrnlen(
268 SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src,
269 SDValue MaxLength, MachinePointerInfo SrcPtrInfo) const {
Richard Sandiford0dec06a2013-08-16 11:41:43 +0000270 EVT PtrVT = Src.getValueType();
271 MaxLength = DAG.getZExtOrTrunc(MaxLength, DL, PtrVT);
272 SDValue Limit = DAG.getNode(ISD::ADD, DL, PtrVT, Src, MaxLength);
273 return getBoundedStrlen(DAG, DL, Chain, Src, Limit);
274}