forked from OSchip/llvm-project
[DAG] Fold FrameIndex offset into BaseIndexOffset analysis. NFCI.
Pull FrameIndex comparision reasoning from DAGCombiner::isAlias to general BaseIndexOffset. llvm-svn: 306498
This commit is contained in:
parent
99b312994c
commit
8ef03802f1
|
@ -57,7 +57,7 @@ public:
|
||||||
int64_t &Off);
|
int64_t &Off);
|
||||||
|
|
||||||
/// Parses tree in Ptr for base, index, offset addresses.
|
/// Parses tree in Ptr for base, index, offset addresses.
|
||||||
static BaseIndexOffset match(SDValue Ptr);
|
static BaseIndexOffset match(SDValue Ptr, const SelectionDAG &DAG);
|
||||||
};
|
};
|
||||||
} // namespace llvm
|
} // namespace llvm
|
||||||
|
|
||||||
|
|
|
@ -4915,7 +4915,7 @@ SDValue DAGCombiner::MatchLoadCombine(SDNode *N) {
|
||||||
return SDValue();
|
return SDValue();
|
||||||
|
|
||||||
// Loads must share the same base address
|
// Loads must share the same base address
|
||||||
BaseIndexOffset Ptr = BaseIndexOffset::match(L->getBasePtr());
|
BaseIndexOffset Ptr = BaseIndexOffset::match(L->getBasePtr(), DAG);
|
||||||
int64_t ByteOffsetFromBase = 0;
|
int64_t ByteOffsetFromBase = 0;
|
||||||
if (!Base)
|
if (!Base)
|
||||||
Base = Ptr;
|
Base = Ptr;
|
||||||
|
@ -12394,7 +12394,7 @@ void DAGCombiner::getStoreMergeCandidates(
|
||||||
StoreSDNode *St, SmallVectorImpl<MemOpLink> &StoreNodes) {
|
StoreSDNode *St, SmallVectorImpl<MemOpLink> &StoreNodes) {
|
||||||
// This holds the base pointer, index, and the offset in bytes from the base
|
// This holds the base pointer, index, and the offset in bytes from the base
|
||||||
// pointer.
|
// pointer.
|
||||||
BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr());
|
BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr(), DAG);
|
||||||
EVT MemVT = St->getMemoryVT();
|
EVT MemVT = St->getMemoryVT();
|
||||||
|
|
||||||
// We must have a base and an offset.
|
// We must have a base and an offset.
|
||||||
|
@ -12414,8 +12414,8 @@ void DAGCombiner::getStoreMergeCandidates(
|
||||||
BaseIndexOffset LBasePtr;
|
BaseIndexOffset LBasePtr;
|
||||||
// Match on loadbaseptr if relevant.
|
// Match on loadbaseptr if relevant.
|
||||||
if (IsLoadSrc)
|
if (IsLoadSrc)
|
||||||
LBasePtr =
|
LBasePtr = BaseIndexOffset::match(
|
||||||
BaseIndexOffset::match(cast<LoadSDNode>(St->getValue())->getBasePtr());
|
cast<LoadSDNode>(St->getValue())->getBasePtr(), DAG);
|
||||||
|
|
||||||
auto CandidateMatch = [&](StoreSDNode *Other, BaseIndexOffset &Ptr,
|
auto CandidateMatch = [&](StoreSDNode *Other, BaseIndexOffset &Ptr,
|
||||||
int64_t &Offset) -> bool {
|
int64_t &Offset) -> bool {
|
||||||
|
@ -12429,7 +12429,7 @@ void DAGCombiner::getStoreMergeCandidates(
|
||||||
if (IsLoadSrc) {
|
if (IsLoadSrc) {
|
||||||
// The Load's Base Ptr must also match
|
// The Load's Base Ptr must also match
|
||||||
if (LoadSDNode *OtherLd = dyn_cast<LoadSDNode>(Other->getValue())) {
|
if (LoadSDNode *OtherLd = dyn_cast<LoadSDNode>(Other->getValue())) {
|
||||||
auto LPtr = BaseIndexOffset::match(OtherLd->getBasePtr());
|
auto LPtr = BaseIndexOffset::match(OtherLd->getBasePtr(), DAG);
|
||||||
if (!(LBasePtr.equalBaseIndex(LPtr, DAG)))
|
if (!(LBasePtr.equalBaseIndex(LPtr, DAG)))
|
||||||
return false;
|
return false;
|
||||||
} else
|
} else
|
||||||
|
@ -12443,7 +12443,7 @@ void DAGCombiner::getStoreMergeCandidates(
|
||||||
if (!(Other->getValue().getOpcode() == ISD::EXTRACT_VECTOR_ELT ||
|
if (!(Other->getValue().getOpcode() == ISD::EXTRACT_VECTOR_ELT ||
|
||||||
Other->getValue().getOpcode() == ISD::EXTRACT_SUBVECTOR))
|
Other->getValue().getOpcode() == ISD::EXTRACT_SUBVECTOR))
|
||||||
return false;
|
return false;
|
||||||
Ptr = BaseIndexOffset::match(Other->getBasePtr());
|
Ptr = BaseIndexOffset::match(Other->getBasePtr(), DAG);
|
||||||
return (BasePtr.equalBaseIndex(Ptr, DAG, Offset));
|
return (BasePtr.equalBaseIndex(Ptr, DAG, Offset));
|
||||||
};
|
};
|
||||||
// We looking for a root node which is an ancestor to all mergable
|
// We looking for a root node which is an ancestor to all mergable
|
||||||
|
@ -12786,7 +12786,7 @@ bool DAGCombiner::MergeConsecutiveStores(StoreSDNode *St) {
|
||||||
if (Ld->getMemoryVT() != MemVT)
|
if (Ld->getMemoryVT() != MemVT)
|
||||||
break;
|
break;
|
||||||
|
|
||||||
BaseIndexOffset LdPtr = BaseIndexOffset::match(Ld->getBasePtr());
|
BaseIndexOffset LdPtr = BaseIndexOffset::match(Ld->getBasePtr(), DAG);
|
||||||
// If this is not the first ptr that we check.
|
// If this is not the first ptr that we check.
|
||||||
int64_t LdOffset = 0;
|
int64_t LdOffset = 0;
|
||||||
if (LdBasePtr.getBase().getNode()) {
|
if (LdBasePtr.getBase().getNode()) {
|
||||||
|
@ -16554,8 +16554,8 @@ bool DAGCombiner::isAlias(LSBaseSDNode *Op0, LSBaseSDNode *Op1) const {
|
||||||
unsigned NumBytes1 = Op1->getMemoryVT().getSizeInBits() >> 3;
|
unsigned NumBytes1 = Op1->getMemoryVT().getSizeInBits() >> 3;
|
||||||
|
|
||||||
// Check for BaseIndexOffset matching.
|
// Check for BaseIndexOffset matching.
|
||||||
BaseIndexOffset BasePtr0 = BaseIndexOffset::match(Op0->getBasePtr());
|
BaseIndexOffset BasePtr0 = BaseIndexOffset::match(Op0->getBasePtr(), DAG);
|
||||||
BaseIndexOffset BasePtr1 = BaseIndexOffset::match(Op1->getBasePtr());
|
BaseIndexOffset BasePtr1 = BaseIndexOffset::match(Op1->getBasePtr(), DAG);
|
||||||
int64_t PtrDiff;
|
int64_t PtrDiff;
|
||||||
if (BasePtr0.equalBaseIndex(BasePtr1, DAG, PtrDiff))
|
if (BasePtr0.equalBaseIndex(BasePtr1, DAG, PtrDiff))
|
||||||
return !((NumBytes0 <= PtrDiff) || (PtrDiff + NumBytes1 <= 0));
|
return !((NumBytes0 <= PtrDiff) || (PtrDiff + NumBytes1 <= 0));
|
||||||
|
@ -16578,18 +16578,6 @@ bool DAGCombiner::isAlias(LSBaseSDNode *Op0, LSBaseSDNode *Op1) const {
|
||||||
return !((Offset0 + NumBytes0) <= Offset1 ||
|
return !((Offset0 + NumBytes0) <= Offset1 ||
|
||||||
(Offset1 + NumBytes1) <= Offset0);
|
(Offset1 + NumBytes1) <= Offset0);
|
||||||
|
|
||||||
// It is possible for different frame indices to alias each other, mostly
|
|
||||||
// when tail call optimization reuses return address slots for arguments.
|
|
||||||
// To catch this case, look up the actual index of frame indices to compute
|
|
||||||
// the real alias relationship.
|
|
||||||
if (IsFrameIndex0 && IsFrameIndex1) {
|
|
||||||
MachineFrameInfo &MFI = DAG.getMachineFunction().getFrameInfo();
|
|
||||||
Offset0 += MFI.getObjectOffset(cast<FrameIndexSDNode>(Base0)->getIndex());
|
|
||||||
Offset1 += MFI.getObjectOffset(cast<FrameIndexSDNode>(Base1)->getIndex());
|
|
||||||
return !((Offset0 + NumBytes0) <= Offset1 ||
|
|
||||||
(Offset1 + NumBytes1) <= Offset0);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Otherwise, if we know what the bases are, and they aren't identical, then
|
// Otherwise, if we know what the bases are, and they aren't identical, then
|
||||||
// we know they cannot alias.
|
// we know they cannot alias.
|
||||||
if ((IsFrameIndex0 || CV0 || GV0) && (IsFrameIndex1 || CV1 || GV1))
|
if ((IsFrameIndex0 || CV0 || GV0) && (IsFrameIndex1 || CV1 || GV1))
|
||||||
|
@ -16765,7 +16753,7 @@ SDValue DAGCombiner::FindBetterChain(SDNode *N, SDValue OldChain) {
|
||||||
bool DAGCombiner::findBetterNeighborChains(StoreSDNode *St) {
|
bool DAGCombiner::findBetterNeighborChains(StoreSDNode *St) {
|
||||||
// This holds the base pointer, index, and the offset in bytes from the base
|
// This holds the base pointer, index, and the offset in bytes from the base
|
||||||
// pointer.
|
// pointer.
|
||||||
BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr());
|
BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr(), DAG);
|
||||||
|
|
||||||
// We must have a base and an offset.
|
// We must have a base and an offset.
|
||||||
if (!BasePtr.getBase().getNode())
|
if (!BasePtr.getBase().getNode())
|
||||||
|
@ -16791,7 +16779,7 @@ bool DAGCombiner::findBetterNeighborChains(StoreSDNode *St) {
|
||||||
break;
|
break;
|
||||||
|
|
||||||
// Find the base pointer and offset for this memory node.
|
// Find the base pointer and offset for this memory node.
|
||||||
BaseIndexOffset Ptr = BaseIndexOffset::match(Index->getBasePtr());
|
BaseIndexOffset Ptr = BaseIndexOffset::match(Index->getBasePtr(), DAG);
|
||||||
|
|
||||||
// Check that the base pointer is the same as the original one.
|
// Check that the base pointer is the same as the original one.
|
||||||
if (!BasePtr.equalBaseIndex(Ptr, DAG))
|
if (!BasePtr.equalBaseIndex(Ptr, DAG))
|
||||||
|
|
|
@ -11,6 +11,7 @@
|
||||||
|
|
||||||
#include "llvm/CodeGen/SelectionDAGAddressAnalysis.h"
|
#include "llvm/CodeGen/SelectionDAGAddressAnalysis.h"
|
||||||
#include "llvm/CodeGen/ISDOpcodes.h"
|
#include "llvm/CodeGen/ISDOpcodes.h"
|
||||||
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
||||||
#include "llvm/CodeGen/SelectionDAG.h"
|
#include "llvm/CodeGen/SelectionDAG.h"
|
||||||
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
||||||
|
|
||||||
|
@ -26,20 +27,28 @@ bool BaseIndexOffset::equalBaseIndex(BaseIndexOffset &Other,
|
||||||
|
|
||||||
// Match GlobalAddresses
|
// Match GlobalAddresses
|
||||||
if (Index == Other.Index)
|
if (Index == Other.Index)
|
||||||
if (GlobalAddressSDNode *A = dyn_cast<GlobalAddressSDNode>(Base))
|
if (auto *A = dyn_cast<GlobalAddressSDNode>(Base))
|
||||||
if (GlobalAddressSDNode *B = dyn_cast<GlobalAddressSDNode>(Other.Base))
|
if (auto *B = dyn_cast<GlobalAddressSDNode>(Other.Base))
|
||||||
if (A->getGlobal() == B->getGlobal()) {
|
if (A->getGlobal() == B->getGlobal()) {
|
||||||
Off += B->getOffset() - A->getOffset();
|
Off += B->getOffset() - A->getOffset();
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: we should be able to add FrameIndex analysis improvements here.
|
// Match FrameIndexes
|
||||||
|
if (Index == Other.Index)
|
||||||
|
if (auto *A = dyn_cast<FrameIndexSDNode>(Base))
|
||||||
|
if (auto *B = dyn_cast<FrameIndexSDNode>(Other.Base)) {
|
||||||
|
const MachineFrameInfo &MFI = DAG.getMachineFunction().getFrameInfo();
|
||||||
|
Off += MFI.getObjectOffset(B->getIndex()) -
|
||||||
|
MFI.getObjectOffset(A->getIndex());
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Parses tree in Ptr for base, index, offset addresses.
|
/// Parses tree in Ptr for base, index, offset addresses.
|
||||||
BaseIndexOffset BaseIndexOffset::match(SDValue Ptr) {
|
BaseIndexOffset BaseIndexOffset::match(SDValue Ptr, const SelectionDAG &DAG) {
|
||||||
// (((B + I*M) + c)) + c ...
|
// (((B + I*M) + c)) + c ...
|
||||||
SDValue Base = Ptr;
|
SDValue Base = Ptr;
|
||||||
SDValue Index = SDValue();
|
SDValue Index = SDValue();
|
||||||
|
|
Loading…
Reference in New Issue