1dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford//===-- SystemZSelectionDAGInfo.cpp - SystemZ SelectionDAG Info -----------===// 2dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// 3dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// The LLVM Compiler Infrastructure 4dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// 5dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// This file is distributed under the University of Illinois Open Source 6dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// License. See LICENSE.TXT for details. 7dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// 8dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford//===----------------------------------------------------------------------===// 9dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// 10dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// This file implements the SystemZSelectionDAGInfo class. 11dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford// 12dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford//===----------------------------------------------------------------------===// 13dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford 14dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford#include "SystemZTargetMachine.h" 15dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford#include "llvm/CodeGen/SelectionDAG.h" 16dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford 17dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandifordusing namespace llvm; 18dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford 19dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines#define DEBUG_TYPE "systemz-selectiondag-info" 20dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 21867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford// Decide whether it is best to use a loop or straight-line code for 22867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford// a block operation of Size bytes with source address Src and destination 23867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford// address Dest. Sequence is the opcode to use for straight-line code 24867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford// (such as MVC) and Loop is the opcode to use for loops (such as MVC_LOOP). 25867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford// Return the chain for the completed operation. 26de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstatic SDValue emitMemMem(SelectionDAG &DAG, const SDLoc &DL, unsigned Sequence, 27867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford unsigned Loop, SDValue Chain, SDValue Dst, 28867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford SDValue Src, uint64_t Size) { 29842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford EVT PtrVT = Src.getValueType(); 30842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // The heuristic we use is to prefer loops for anything that would 31842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // require 7 or more MVCs. With these kinds of sizes there isn't 32842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // much to choose between straight-line code and looping code, 33842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // since the time will be dominated by the MVCs themselves. 34842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // However, the loop has 4 or 5 instructions (depending on whether 35842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // the base addresses can be proved equal), so there doesn't seem 36842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // much point using a loop for 5 * 256 bytes or fewer. Anything in 37842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // the range (5 * 256, 6 * 256) will need another instruction after 38842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // the loop, so it doesn't seem worth using a loop then either. 39842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // The next value up, 6 * 256, can be implemented in the same 40842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // number of straight-line MVCs as 6 * 256 - 1. 41842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford if (Size > 6 * 256) 42867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford return DAG.getNode(Loop, DL, MVT::Other, Chain, Dst, Src, 436948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size, DL, PtrVT), 446948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size / 256, DL, PtrVT)); 45867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford return DAG.getNode(Sequence, DL, MVT::Other, Chain, Dst, Src, 466948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size, DL, PtrVT)); 47842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford} 48842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford 49de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga NainarSDValue SystemZSelectionDAGInfo::EmitTargetCodeForMemcpy( 50de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dst, SDValue Src, 51de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Size, unsigned Align, bool IsVolatile, bool AlwaysInline, 52de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar MachinePointerInfo DstPtrInfo, MachinePointerInfo SrcPtrInfo) const { 53dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford if (IsVolatile) 54dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford return SDValue(); 55dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford 5636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (auto *CSize = dyn_cast<ConstantSDNode>(Size)) 57867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford return emitMemMem(DAG, DL, SystemZISD::MVC, SystemZISD::MVC_LOOP, 58867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford Chain, Dst, Src, CSize->getZExtValue()); 59dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford return SDValue(); 60dff0009d0ced62b92cb5900bc2203ec40142ba15Richard Sandiford} 61f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford 62f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford// Handle a memset of 1, 2, 4 or 8 bytes with the operands given by 63f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford// Chain, Dst, ByteVal and Size. These cases are expected to use 64f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford// MVI, MVHHI, MVHI and MVGHI respectively. 65de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstatic SDValue memsetStore(SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, 66f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford SDValue Dst, uint64_t ByteVal, uint64_t Size, 67de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar unsigned Align, MachinePointerInfo DstPtrInfo) { 68f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford uint64_t StoreVal = ByteVal; 69f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford for (unsigned I = 1; I < Size; ++I) 70f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford StoreVal |= ByteVal << (I * 8); 71f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return DAG.getStore(Chain, DL, 726948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(StoreVal, DL, 736948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar MVT::getIntegerVT(Size * 8)), 74f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford Dst, DstPtrInfo, false, false, Align); 75f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford} 76f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford 77de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga NainarSDValue SystemZSelectionDAGInfo::EmitTargetCodeForMemset( 78de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dst, 79de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Byte, SDValue Size, unsigned Align, bool IsVolatile, 80de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar MachinePointerInfo DstPtrInfo) const { 81842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford EVT PtrVT = Dst.getValueType(); 82f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford 83f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (IsVolatile) 84f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return SDValue(); 85f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford 8636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (auto *CSize = dyn_cast<ConstantSDNode>(Size)) { 87f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford uint64_t Bytes = CSize->getZExtValue(); 88f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (Bytes == 0) 89f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return SDValue(); 9036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (auto *CByte = dyn_cast<ConstantSDNode>(Byte)) { 91f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford // Handle cases that can be done using at most two of 92f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford // MVI, MVHI, MVHHI and MVGHI. The latter two can only be 93f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford // used if ByteVal is all zeros or all ones; in other casees, 94f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford // we can move at most 2 halfwords. 95f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford uint64_t ByteVal = CByte->getZExtValue(); 96f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (ByteVal == 0 || ByteVal == 255 ? 97ebe69fe11e48d322045d5949c83283927a0d790bStephen Hines Bytes <= 16 && countPopulation(Bytes) <= 2 : 98f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford Bytes <= 4) { 99f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford unsigned Size1 = Bytes == 16 ? 8 : 1 << findLastSet(Bytes); 100f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford unsigned Size2 = Bytes - Size1; 101f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford SDValue Chain1 = memsetStore(DAG, DL, Chain, Dst, ByteVal, Size1, 102f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford Align, DstPtrInfo); 103f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (Size2 == 0) 104f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return Chain1; 105842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford Dst = DAG.getNode(ISD::ADD, DL, PtrVT, Dst, 1066948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size1, DL, PtrVT)); 107f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford DstPtrInfo = DstPtrInfo.getWithOffset(Size1); 108f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford SDValue Chain2 = memsetStore(DAG, DL, Chain, Dst, ByteVal, Size2, 109f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford std::min(Align, Size1), DstPtrInfo); 110f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chain1, Chain2); 111f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford } 112f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford } else { 113f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford // Handle one and two bytes using STC. 114f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (Bytes <= 2) { 115f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford SDValue Chain1 = DAG.getStore(Chain, DL, Byte, Dst, DstPtrInfo, 116f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford false, false, Align); 117f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford if (Bytes == 1) 118f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return Chain1; 119842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford SDValue Dst2 = DAG.getNode(ISD::ADD, DL, PtrVT, Dst, 1206948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(1, DL, PtrVT)); 121f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford SDValue Chain2 = DAG.getStore(Chain, DL, Byte, Dst2, 122f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford DstPtrInfo.getWithOffset(1), 123f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford false, false, 1); 124f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chain1, Chain2); 125f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford } 126f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford } 127f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford assert(Bytes >= 2 && "Should have dealt with 0- and 1-byte cases already"); 128867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford 129867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford // Handle the special case of a memset of 0, which can use XC. 13036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines auto *CByte = dyn_cast<ConstantSDNode>(Byte); 131867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford if (CByte && CByte->getZExtValue() == 0) 132867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford return emitMemMem(DAG, DL, SystemZISD::XC, SystemZISD::XC_LOOP, 133867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford Chain, Dst, Dst, Bytes); 134867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford 135842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // Copy the byte to the first location and then use MVC to copy 136842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford // it to the rest. 137842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford Chain = DAG.getStore(Chain, DL, Byte, Dst, DstPtrInfo, 138842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford false, false, Align); 139842a1be06c53757e7498c9894abc1431b633a92fRichard Sandiford SDValue DstPlus1 = DAG.getNode(ISD::ADD, DL, PtrVT, Dst, 1406948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(1, DL, PtrVT)); 141867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford return emitMemMem(DAG, DL, SystemZISD::MVC, SystemZISD::MVC_LOOP, 142867f9501f64c12a693bed624c53e8104421917a9Richard Sandiford Chain, DstPlus1, Dst, Bytes - 1); 143f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford } 144f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford return SDValue(); 145f6ea5e0d8007234fc74c1ff6ac2c3ca316c41d92Richard Sandiford} 146ac168b8bc8773a083a10902f64e4ae57a925aee4Richard Sandiford 14747e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford// Use CLC to compare [Src1, Src1 + Size) with [Src2, Src2 + Size), 14847e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford// deciding whether to use a loop or straight-line code. 149de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstatic SDValue emitCLC(SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, 15047e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford SDValue Src1, SDValue Src2, uint64_t Size) { 15147e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford SDVTList VTs = DAG.getVTList(MVT::Other, MVT::Glue); 15247e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford EVT PtrVT = Src1.getValueType(); 15347e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // A two-CLC sequence is a clear win over a loop, not least because it 15447e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // needs only one branch. A three-CLC sequence needs the same number 15547e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // of branches as a loop (i.e. 2), but is shorter. That brings us to 15647e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // lengths greater than 768 bytes. It seems relatively likely that 15747e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // a difference will be found within the first 768 bytes, so we just 15847e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // optimize for the smallest number of branch instructions, in order 15947e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // to avoid polluting the prediction buffer too much. A loop only ever 16047e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford // needs 2 branches, whereas a straight-line sequence would need 3 or more. 16147e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford if (Size > 3 * 256) 16247e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford return DAG.getNode(SystemZISD::CLC_LOOP, DL, VTs, Chain, Src1, Src2, 1636948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size, DL, PtrVT), 1646948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size / 256, DL, PtrVT)); 16547e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford return DAG.getNode(SystemZISD::CLC, DL, VTs, Chain, Src1, Src2, 1666948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(Size, DL, PtrVT)); 16747e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford} 16847e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford 169e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford// Convert the current CC value into an integer that is 0 if CC == 0, 170e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford// less than zero if CC == 1 and greater than zero if CC >= 2. 171e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford// The sequence starts with IPM, which puts CC into bits 29 and 28 172e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford// of an integer and clears bits 30 and 31. 173de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstatic SDValue addIPMSequence(const SDLoc &DL, SDValue Glue, 174de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG) { 175e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDValue IPM = DAG.getNode(SystemZISD::IPM, DL, MVT::i32, Glue); 176e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDValue SRL = DAG.getNode(ISD::SRL, DL, MVT::i32, IPM, 1776948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(SystemZ::IPM_CC, DL, MVT::i32)); 178e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDValue ROTL = DAG.getNode(ISD::ROTL, DL, MVT::i32, SRL, 1796948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(31, DL, MVT::i32)); 180e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford return ROTL; 181e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford} 182e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford 183de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemcmp( 184de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src1, 185de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Src2, SDValue Size, MachinePointerInfo Op1PtrInfo, 186de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar MachinePointerInfo Op2PtrInfo) const { 18736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (auto *CSize = dyn_cast<ConstantSDNode>(Size)) { 188ac168b8bc8773a083a10902f64e4ae57a925aee4Richard Sandiford uint64_t Bytes = CSize->getZExtValue(); 18947e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford assert(Bytes > 0 && "Caller should have handled 0-size case"); 19047e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford Chain = emitCLC(DAG, DL, Chain, Src1, Src2, Bytes); 19147e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford SDValue Glue = Chain.getValue(1); 19247e70960945ecb33a361987a9745e3dc80a1c78cRichard Sandiford return std::make_pair(addIPMSequence(DL, Glue, DAG), Chain); 193ac168b8bc8773a083a10902f64e4ae57a925aee4Richard Sandiford } 194ac168b8bc8773a083a10902f64e4ae57a925aee4Richard Sandiford return std::make_pair(SDValue(), SDValue()); 195ac168b8bc8773a083a10902f64e4ae57a925aee4Richard Sandiford} 196e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford 197de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForMemchr( 198de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src, 199de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Char, SDValue Length, MachinePointerInfo SrcPtrInfo) const { 2008c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford // Use SRST to find the character. End is its address on success. 2018c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford EVT PtrVT = Src.getValueType(); 2028c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford SDVTList VTs = DAG.getVTList(PtrVT, MVT::Other, MVT::Glue); 2038c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford Length = DAG.getZExtOrTrunc(Length, DL, PtrVT); 2048c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford Char = DAG.getZExtOrTrunc(Char, DL, MVT::i32); 2058c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford Char = DAG.getNode(ISD::AND, DL, MVT::i32, Char, 2066948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(255, DL, MVT::i32)); 2078c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford SDValue Limit = DAG.getNode(ISD::ADD, DL, PtrVT, Src, Length); 2088c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford SDValue End = DAG.getNode(SystemZISD::SEARCH_STRING, DL, VTs, Chain, 2098c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford Limit, Src, Char); 2108c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford Chain = End.getValue(1); 2118c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford SDValue Glue = End.getValue(2); 2128c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford 2138c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford // Now select between End and null, depending on whether the character 2148c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford // was found. 2156948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar SDValue Ops[] = {End, DAG.getConstant(0, DL, PtrVT), 2166948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(SystemZ::CCMASK_SRST, DL, MVT::i32), 2176948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(SystemZ::CCMASK_SRST_FOUND, DL, MVT::i32), 2186948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar Glue}; 2198c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford VTs = DAG.getVTList(PtrVT, MVT::Glue); 220dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines End = DAG.getNode(SystemZISD::SELECT_CCMASK, DL, VTs, Ops); 2218c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford return std::make_pair(End, Chain); 2228c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford} 2238c20158fb0e1e5d747077f065eb0170c5af1fbfaRichard Sandiford 224de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcpy( 225de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Dest, 226de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Src, MachinePointerInfo DestPtrInfo, MachinePointerInfo SrcPtrInfo, 227de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar bool isStpcpy) const { 2284fc7355a21e1fa838406e15459aaf54a58fcf909Richard Sandiford SDVTList VTs = DAG.getVTList(Dest.getValueType(), MVT::Other); 2294fc7355a21e1fa838406e15459aaf54a58fcf909Richard Sandiford SDValue EndDest = DAG.getNode(SystemZISD::STPCPY, DL, VTs, Chain, Dest, Src, 2306948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(0, DL, MVT::i32)); 2314fc7355a21e1fa838406e15459aaf54a58fcf909Richard Sandiford return std::make_pair(isStpcpy ? EndDest : Dest, EndDest.getValue(1)); 2324fc7355a21e1fa838406e15459aaf54a58fcf909Richard Sandiford} 2334fc7355a21e1fa838406e15459aaf54a58fcf909Richard Sandiford 234de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrcmp( 235de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src1, 236de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue Src2, MachinePointerInfo Op1PtrInfo, 237de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar MachinePointerInfo Op2PtrInfo) const { 238e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDVTList VTs = DAG.getVTList(Src1.getValueType(), MVT::Other, MVT::Glue); 239e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDValue Unused = DAG.getNode(SystemZISD::STRCMP, DL, VTs, Chain, Src1, Src2, 2406948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar DAG.getConstant(0, DL, MVT::i32)); 241e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford Chain = Unused.getValue(1); 242e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford SDValue Glue = Chain.getValue(2); 243e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford return std::make_pair(addIPMSequence(DL, Glue, DAG), Chain); 244e1b2af731e2a45344a7c502232f66c55cd746da0Richard Sandiford} 24519262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford 24619262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford// Search from Src for a null character, stopping once Src reaches Limit. 24719262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford// Return a pair of values, the first being the number of nonnull characters 24819262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford// and the second being the out chain. 24919262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford// 25019262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford// This can be used for strlen by setting Limit to 0. 251de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstatic std::pair<SDValue, SDValue> getBoundedStrlen(SelectionDAG &DAG, 252de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar const SDLoc &DL, 25319262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDValue Chain, SDValue Src, 25419262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDValue Limit) { 25519262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford EVT PtrVT = Src.getValueType(); 25619262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDVTList VTs = DAG.getVTList(PtrVT, MVT::Other, MVT::Glue); 25719262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDValue End = DAG.getNode(SystemZISD::SEARCH_STRING, DL, VTs, Chain, 2586948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar Limit, Src, DAG.getConstant(0, DL, MVT::i32)); 25919262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford Chain = End.getValue(1); 26019262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDValue Len = DAG.getNode(ISD::SUB, DL, PtrVT, End, Src); 26119262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford return std::make_pair(Len, Chain); 262de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar} 26319262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford 264de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrlen( 265de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src, 266de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar MachinePointerInfo SrcPtrInfo) const { 26719262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford EVT PtrVT = Src.getValueType(); 2686948897e478cbd66626159776a8017b3c18579b9Pirama Arumuga Nainar return getBoundedStrlen(DAG, DL, Chain, Src, DAG.getConstant(0, DL, PtrVT)); 26919262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford} 27019262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford 271de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainarstd::pair<SDValue, SDValue> SystemZSelectionDAGInfo::EmitTargetCodeForStrnlen( 272de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SelectionDAG &DAG, const SDLoc &DL, SDValue Chain, SDValue Src, 273de2d8694e25a814696358e95141f4b1aa4d8847ePirama Arumuga Nainar SDValue MaxLength, MachinePointerInfo SrcPtrInfo) const { 27419262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford EVT PtrVT = Src.getValueType(); 27519262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford MaxLength = DAG.getZExtOrTrunc(MaxLength, DL, PtrVT); 27619262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford SDValue Limit = DAG.getNode(ISD::ADD, DL, PtrVT, Src, MaxLength); 27719262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford return getBoundedStrlen(DAG, DL, Chain, Src, Limit); 27819262ee0725a09b7c621a3d2eb66ba1513ae932aRichard Sandiford} 279