1//==- llvm/CodeGen/SelectionDAGAddressAnalysis.cpp - DAG Address Analysis --==// 3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4// See https://llvm.org/LICENSE.txt for license information. 5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7//===----------------------------------------------------------------------===// 27// Conservatively fail if we a match failed.. 28if (!
Base.getNode() || !
Other.Base.getNode())
32// Initial Offset difference. 33 Off = *
Other.Offset - *Offset;
35if ((
Other.Index == Index) && (
Other.IsIndexSignExt == IsIndexSignExt)) {
40// Match GlobalAddresses 41if (
auto *
A = dyn_cast<GlobalAddressSDNode>(
Base)) {
42if (
auto *
B = dyn_cast<GlobalAddressSDNode>(
Other.Base))
43if (
A->getGlobal() ==
B->getGlobal()) {
44 Off +=
B->getOffset() -
A->getOffset();
52if (
auto *
A = dyn_cast<ConstantPoolSDNode>(
Base)) {
53if (
auto *
B = dyn_cast<ConstantPoolSDNode>(
Other.Base)) {
55A->isMachineConstantPoolEntry() ==
B->isMachineConstantPoolEntry();
57if (
A->isMachineConstantPoolEntry())
58 IsMatch =
A->getMachineCPVal() ==
B->getMachineCPVal();
60 IsMatch =
A->getConstVal() ==
B->getConstVal();
63 Off +=
B->getOffset() -
A->getOffset();
72if (
auto *
A = dyn_cast<FrameIndexSDNode>(
Base))
73if (
auto *
B = dyn_cast<FrameIndexSDNode>(
Other.Base)) {
74// Equal FrameIndexes - offsets are directly comparable. 75if (
A->getIndex() ==
B->getIndex())
77// Non-equal FrameIndexes - If both frame indices are fixed 78// we know their relative offsets and can compare them. Otherwise 79// we must be conservative. 99if (!BasePtr0.
getBase().getNode())
103if (!BasePtr1.
getBase().getNode())
107if (BasePtr0.equalBaseIndex(BasePtr1, DAG, PtrDiff)) {
108// If the size of memory access is unknown, do not use it to analysis. 109// BasePtr1 is PtrDiff away from BasePtr0. They alias if none of the 110// following situations arise: 114// ========PtrDiff========> 122// =====(-PtrDiff)====> 123 IsAlias = !((PtrDiff +
static_cast<int64_t
>(
129// If both BasePtr0 and BasePtr1 are FrameIndexes, we will not be 130// able to calculate their relative offset if at least one arises 131// from an alloca. However, these allocas cannot overlap and we 132// can infer there is no alias. 133if (
auto *
A = dyn_cast<FrameIndexSDNode>(BasePtr0.
getBase()))
134if (
auto *
B = dyn_cast<FrameIndexSDNode>(BasePtr1.
getBase())) {
136// If the base are the same frame index but the we couldn't find a 137// constant offset, (indices are different) be conservative. 145bool IsFI0 = isa<FrameIndexSDNode>(BasePtr0.
getBase());
146bool IsFI1 = isa<FrameIndexSDNode>(BasePtr1.
getBase());
147bool IsGV0 = isa<GlobalAddressSDNode>(BasePtr0.
getBase());
148bool IsGV1 = isa<GlobalAddressSDNode>(BasePtr1.
getBase());
149bool IsCV0 = isa<ConstantPoolSDNode>(BasePtr0.
getBase());
150bool IsCV1 = isa<ConstantPoolSDNode>(BasePtr1.
getBase());
152if ((IsFI0 || IsGV0 || IsCV0) && (IsFI1 || IsGV1 || IsCV1)) {
153// We can derive NoAlias In case of mismatched base types. 154if (IsFI0 != IsFI1 || IsGV0 != IsGV1 || IsCV0 != IsCV1) {
159auto *GV0 = cast<GlobalAddressSDNode>(BasePtr0.
getBase())->getGlobal();
160auto *GV1 = cast<GlobalAddressSDNode>(BasePtr1.
getBase())->getGlobal();
161// It doesn't make sense to access one global value using another globals 162// values address, so we can assume that there is no aliasing in case of 163// two different globals (unless we have symbols that may indirectly point 165// FIXME: This is perhaps a bit too defensive. We could try to follow the 166// chain with aliasee information for GlobalAlias variables to find out if 167// we indirect symbols may alias or not. 168if (GV0 != GV1 && !isa<GlobalAlias>(GV0) && !isa<GlobalAlias>(GV1)) {
174returnfalse;
// Cannot determine whether the pointers alias. 179 int64_t OtherBitSize, int64_t &BitOffset)
const{
181if (!equalBaseIndex(
Other, DAG, Offset))
184// Other is after *this: 185// [-------*this---------] 188 BitOffset = 8 * Offset;
189return BitOffset + OtherBitSize <= BitSize;
191// Other starts strictly before *this, it cannot be fully contained. 192// [-------*this---------] 197/// Parses tree in Ptr for base, index, offset addresses. 202// (((B + I*M) + c)) + c ... 206bool IsIndexSignExt =
false;
208// pre-inc/pre-dec ops are components of EA. 210if (
auto *
C = dyn_cast<ConstantSDNode>(
N->getOffset()))
212else// If unknown, give up now. 215if (
auto *
C = dyn_cast<ConstantSDNode>(
N->getOffset()))
217else// If unknown, give up now. 221// Consume constant adds & ors with appropriate masking. 223switch (
Base->getOpcode()) {
225// Only consider ORs which act as adds. 226if (
auto *
C = dyn_cast<ConstantSDNode>(
Base->getOperand(1)))
234if (
auto *
C = dyn_cast<ConstantSDNode>(
Base->getOperand(1))) {
242auto *LSBase = cast<LSBaseSDNode>(
Base.getNode());
243unsignedint IndexResNo = (
Base->getOpcode() ==
ISD::LOAD) ? 1 : 0;
244if (LSBase->isIndexed() &&
Base.getResNo() == IndexResNo)
245if (
auto *
C = dyn_cast<ConstantSDNode>(LSBase->getOffset())) {
246auto Off =
C->getSExtValue();
258// If we get here break out of the loop. 263// TODO: The following code appears to be needless as it just 264// bails on some Ptrs early, reducing the cases where we 265// find equivalence. We should be able to remove this. 266// Inside a loop the current BASE pointer is calculated using an ADD and a 267// MUL instruction. In this case Base is the actual BASE pointer. 268// (i64 add (i64 %array_ptr) 269// (i64 mul (i64 %induction_var) 270// (i64 %element_size))) 274// Look at Base + Index + Offset cases. 275 Index =
Base->getOperand(1);
280 Index = Index->getOperand(0);
281 IsIndexSignExt =
true;
284// Check if Index Offset pattern 286 !isa<ConstantSDNode>(Index->getOperand(1)))
289Offset += cast<ConstantSDNode>(Index->getOperand(1))->getSExtValue();
290 Index = Index->getOperand(0);
292 Index = Index->getOperand(0);
293 IsIndexSignExt =
true;
295 IsIndexSignExt =
false;
303if (
constauto *LS0 = dyn_cast<LSBaseSDNode>(
N))
305if (
constauto *LN = dyn_cast<LifetimeSDNode>(
N)) {
314#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP) 321OS <<
"BaseIndexOffset base=[";
326OS <<
"] offset=" << Offset;
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
static GCRegistry::Add< ErlangGC > A("erlang", "erlang-compatible garbage collector")
#define LLVM_DUMP_METHOD
Mark debug helper function definitions like dump() that should not be stripped from debug builds.
std::optional< std::vector< StOtherPiece > > Other
This file provides utility analysis objects describing memory locations.
static BaseIndexOffset matchLSNode(const LSBaseSDNode *N, const SelectionDAG &DAG)
Parses tree in Ptr for base, index, offset addresses.
This file describes how to lower LLVM code to machine code.
bool contains(const SelectionDAG &DAG, int64_t BitSize, const BaseIndexOffset &Other, int64_t OtherBitSize, int64_t &BitOffset) const
void print(raw_ostream &OS) const
static BaseIndexOffset match(const SDNode *N, const SelectionDAG &DAG)
Parses tree in N for base, index, offset addresses.
static bool computeAliasing(const SDNode *Op0, const LocationSize NumBytes0, const SDNode *Op1, const LocationSize NumBytes1, const SelectionDAG &DAG, bool &IsAlias)
bool equalBaseIndex(const BaseIndexOffset &Other, const SelectionDAG &DAG, int64_t &Off) const
Helper struct to store a base, index and offset that forms an address.
BaseIndexOffset()=default
bool hasValidOffset() const
Base class for LoadSDNode and StoreSDNode.
TypeSize getValue() const
The MachineFrameInfo class represents an abstract stack frame until prolog/epilog code is inserted.
int64_t getObjectOffset(int ObjectIdx) const
Return the assigned stack offset of the specified object from the incoming stack pointer.
bool isFixedObjectIndex(int ObjectIdx) const
Returns true if the specified index corresponds to a fixed stack object.
MachineFrameInfo & getFrameInfo()
getFrameInfo - Return the frame info object for the current function.
Represents one node in the SelectionDAG.
Unlike LLVM values, Selection DAG nodes may return multiple values as the result of a computation.
This is used to represent a portion of an LLVM function in a low-level Data Dependence DAG representa...
const TargetLowering & getTargetLoweringInfo() const
MachineFunction & getMachineFunction() const
bool MaskedValueIsZero(SDValue Op, const APInt &Mask, unsigned Depth=0) const
Return true if 'Op & Mask' is known to be zero.
virtual SDValue unwrapAddress(SDValue N) const
constexpr ScalarTy getFixedValue() const
This class implements an extremely fast bulk output stream that can only output to a stream.
@ C
The default llvm calling convention, compatible with C.
@ ADD
Simple integer binary arithmetic operators.
@ LOAD
LOAD and STORE have token chains as their first operand, then the same operands as an LLVM load/store...
@ SIGN_EXTEND
Conversion operators.
bool match(Val *V, const Pattern &P)
This is an optimization pass for GlobalISel generic memory operations.
Printable print(const GCNRegPressure &RP, const GCNSubtarget *ST=nullptr)
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.