mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-20 20:15:49 -04:00

to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
180 lines
6.5 KiB
C++
180 lines
6.5 KiB
C++
//==- llvm/CodeGen/SelectionDAGAddressAnalysis.cpp - DAG Address Analysis --==//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/CodeGen/SelectionDAGAddressAnalysis.h"
|
|
#include "llvm/CodeGen/ISDOpcodes.h"
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
|
#include "llvm/CodeGen/SelectionDAGNodes.h"
|
|
#include "llvm/CodeGen/TargetLowering.h"
|
|
#include "llvm/Support/Casting.h"
|
|
#include <cstdint>
|
|
|
|
using namespace llvm;
|
|
|
|
bool BaseIndexOffset::equalBaseIndex(const BaseIndexOffset &Other,
|
|
const SelectionDAG &DAG,
|
|
int64_t &Off) const {
|
|
// Conservatively fail if we a match failed..
|
|
if (!Base.getNode() || !Other.Base.getNode())
|
|
return false;
|
|
// Initial Offset difference.
|
|
Off = Other.Offset - Offset;
|
|
|
|
if ((Other.Index == Index) && (Other.IsIndexSignExt == IsIndexSignExt)) {
|
|
// Trivial match.
|
|
if (Other.Base == Base)
|
|
return true;
|
|
|
|
// Match GlobalAddresses
|
|
if (auto *A = dyn_cast<GlobalAddressSDNode>(Base))
|
|
if (auto *B = dyn_cast<GlobalAddressSDNode>(Other.Base))
|
|
if (A->getGlobal() == B->getGlobal()) {
|
|
Off += B->getOffset() - A->getOffset();
|
|
return true;
|
|
}
|
|
|
|
// Match Constants
|
|
if (auto *A = dyn_cast<ConstantPoolSDNode>(Base))
|
|
if (auto *B = dyn_cast<ConstantPoolSDNode>(Other.Base)) {
|
|
bool IsMatch =
|
|
A->isMachineConstantPoolEntry() == B->isMachineConstantPoolEntry();
|
|
if (IsMatch) {
|
|
if (A->isMachineConstantPoolEntry())
|
|
IsMatch = A->getMachineCPVal() == B->getMachineCPVal();
|
|
else
|
|
IsMatch = A->getConstVal() == B->getConstVal();
|
|
}
|
|
if (IsMatch) {
|
|
Off += B->getOffset() - A->getOffset();
|
|
return true;
|
|
}
|
|
}
|
|
|
|
const MachineFrameInfo &MFI = DAG.getMachineFunction().getFrameInfo();
|
|
|
|
// Match non-equal FrameIndexes - If both frame indices are fixed
|
|
// we know their relative offsets and can compare them. Otherwise
|
|
// we must be conservative.
|
|
if (auto *A = dyn_cast<FrameIndexSDNode>(Base))
|
|
if (auto *B = dyn_cast<FrameIndexSDNode>(Other.Base))
|
|
if (MFI.isFixedObjectIndex(A->getIndex()) &&
|
|
MFI.isFixedObjectIndex(B->getIndex())) {
|
|
Off += MFI.getObjectOffset(B->getIndex()) -
|
|
MFI.getObjectOffset(A->getIndex());
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
/// Parses tree in Ptr for base, index, offset addresses.
|
|
BaseIndexOffset BaseIndexOffset::match(const LSBaseSDNode *N,
|
|
const SelectionDAG &DAG) {
|
|
SDValue Ptr = N->getBasePtr();
|
|
|
|
// (((B + I*M) + c)) + c ...
|
|
SDValue Base = DAG.getTargetLoweringInfo().unwrapAddress(Ptr);
|
|
SDValue Index = SDValue();
|
|
int64_t Offset = 0;
|
|
bool IsIndexSignExt = false;
|
|
|
|
// pre-inc/pre-dec ops are components of EA.
|
|
if (N->getAddressingMode() == ISD::PRE_INC) {
|
|
if (auto *C = dyn_cast<ConstantSDNode>(N->getOffset()))
|
|
Offset += C->getSExtValue();
|
|
else // If unknown, give up now.
|
|
return BaseIndexOffset(SDValue(), SDValue(), 0, false);
|
|
} else if (N->getAddressingMode() == ISD::PRE_DEC) {
|
|
if (auto *C = dyn_cast<ConstantSDNode>(N->getOffset()))
|
|
Offset -= C->getSExtValue();
|
|
else // If unknown, give up now.
|
|
return BaseIndexOffset(SDValue(), SDValue(), 0, false);
|
|
}
|
|
|
|
// Consume constant adds & ors with appropriate masking.
|
|
while (true) {
|
|
switch (Base->getOpcode()) {
|
|
case ISD::OR:
|
|
// Only consider ORs which act as adds.
|
|
if (auto *C = dyn_cast<ConstantSDNode>(Base->getOperand(1)))
|
|
if (DAG.MaskedValueIsZero(Base->getOperand(0), C->getAPIntValue())) {
|
|
Offset += C->getSExtValue();
|
|
Base = DAG.getTargetLoweringInfo().unwrapAddress(Base->getOperand(0));
|
|
continue;
|
|
}
|
|
break;
|
|
case ISD::ADD:
|
|
if (auto *C = dyn_cast<ConstantSDNode>(Base->getOperand(1))) {
|
|
Offset += C->getSExtValue();
|
|
Base = DAG.getTargetLoweringInfo().unwrapAddress(Base->getOperand(0));
|
|
continue;
|
|
}
|
|
break;
|
|
case ISD::LOAD:
|
|
case ISD::STORE: {
|
|
auto *LSBase = cast<LSBaseSDNode>(Base.getNode());
|
|
unsigned int IndexResNo = (Base->getOpcode() == ISD::LOAD) ? 1 : 0;
|
|
if (LSBase->isIndexed() && Base.getResNo() == IndexResNo)
|
|
if (auto *C = dyn_cast<ConstantSDNode>(LSBase->getOffset())) {
|
|
auto Off = C->getSExtValue();
|
|
if (LSBase->getAddressingMode() == ISD::PRE_DEC ||
|
|
LSBase->getAddressingMode() == ISD::POST_DEC)
|
|
Offset -= Off;
|
|
else
|
|
Offset += Off;
|
|
Base = DAG.getTargetLoweringInfo().unwrapAddress(LSBase->getBasePtr());
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
// If we get here break out of the loop.
|
|
break;
|
|
}
|
|
|
|
if (Base->getOpcode() == ISD::ADD) {
|
|
// TODO: The following code appears to be needless as it just
|
|
// bails on some Ptrs early, reducing the cases where we
|
|
// find equivalence. We should be able to remove this.
|
|
// Inside a loop the current BASE pointer is calculated using an ADD and a
|
|
// MUL instruction. In this case Base is the actual BASE pointer.
|
|
// (i64 add (i64 %array_ptr)
|
|
// (i64 mul (i64 %induction_var)
|
|
// (i64 %element_size)))
|
|
if (Base->getOperand(1)->getOpcode() == ISD::MUL)
|
|
return BaseIndexOffset(Base, Index, Offset, IsIndexSignExt);
|
|
|
|
// Look at Base + Index + Offset cases.
|
|
Index = Base->getOperand(1);
|
|
SDValue PotentialBase = Base->getOperand(0);
|
|
|
|
// Skip signextends.
|
|
if (Index->getOpcode() == ISD::SIGN_EXTEND) {
|
|
Index = Index->getOperand(0);
|
|
IsIndexSignExt = true;
|
|
}
|
|
|
|
// Check if Index Offset pattern
|
|
if (Index->getOpcode() != ISD::ADD ||
|
|
!isa<ConstantSDNode>(Index->getOperand(1)))
|
|
return BaseIndexOffset(PotentialBase, Index, Offset, IsIndexSignExt);
|
|
|
|
Offset += cast<ConstantSDNode>(Index->getOperand(1))->getSExtValue();
|
|
Index = Index->getOperand(0);
|
|
if (Index->getOpcode() == ISD::SIGN_EXTEND) {
|
|
Index = Index->getOperand(0);
|
|
IsIndexSignExt = true;
|
|
} else
|
|
IsIndexSignExt = false;
|
|
Base = PotentialBase;
|
|
}
|
|
return BaseIndexOffset(Base, Index, Offset, IsIndexSignExt);
|
|
}
|