Skip to content

[AMDGPU] Refine GCNHazardRecognizer hasHazard() #138841

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
127 changes: 96 additions & 31 deletions llvm/lib/Target/AMDGPU/GCNHazardRecognizer.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -436,42 +436,96 @@ using IsExpiredFn = function_ref<bool(const MachineInstr &, int WaitStates)>;
using GetNumWaitStatesFn = function_ref<unsigned int(const MachineInstr &)>;

// Search for a hazard in a block and its predecessors.
// StateT must implement getHashValue() and isEqual().
template <typename StateT>
static bool
hasHazard(StateT State,
hasHazard(StateT InitialState,
function_ref<HazardFnResult(StateT &, const MachineInstr &)> IsHazard,
function_ref<void(StateT &, const MachineInstr &)> UpdateState,
const MachineBasicBlock *MBB,
MachineBasicBlock::const_reverse_instr_iterator I,
DenseSet<const MachineBasicBlock *> &Visited) {
for (auto E = MBB->instr_rend(); I != E; ++I) {
// No need to look at parent BUNDLE instructions.
if (I->isBundle())
continue;

switch (IsHazard(State, *I)) {
case HazardFound:
return true;
case HazardExpired:
return false;
default:
// Continue search
break;
const MachineBasicBlock *InitialMBB,
MachineBasicBlock::const_reverse_instr_iterator InitialI) {
SmallVector<std::pair<const MachineBasicBlock *, unsigned>> Worklist;
SmallDenseSet<std::pair<const MachineBasicBlock *, unsigned>> Visited;
SmallVector<std::pair<unsigned, unsigned>, 1> Collisions;
SmallDenseMap<unsigned, unsigned> StateHash2Idx;
SmallVector<StateT> States;

// States contains a vector of unique state structures.
// StateT is hashed via getHashValue() and StateHash2Idx maps each hash
// to an index in the States vector.
// In the unlikely event of a hash collision the Collision vector provides
// additional hash to index associations which must be retrieved by a linear
// scan.

// Retrieve unique constant index for a StateT structure in the States vector.
auto ResolveStateIdx = [&](const StateT State) {
unsigned StateHash = State.getHashValue();
unsigned StateIdx;
if (!StateHash2Idx.contains(StateHash)) {
StateIdx = States.size();
States.push_back(State);
StateHash2Idx[StateHash] = StateIdx;
} else {
StateIdx = StateHash2Idx[StateHash];
if (LLVM_UNLIKELY(!StateT::isEqual(State, States[StateIdx]))) {
// Hash collision
auto Collision = llvm::find_if(Collisions, [&](auto &C) {
return C.first == StateHash &&
StateT::isEqual(State, States[C.second]);
});
if (Collision != Collisions.end()) {
StateIdx = Collision->second;
} else {
StateIdx = States.size();
States.push_back(State);
Collisions.emplace_back(StateHash, StateIdx);
}
}
}
return StateIdx;
};

if (I->isInlineAsm() || I->isMetaInstruction())
continue;
const MachineBasicBlock *MBB = InitialMBB;
StateT State = InitialState;
auto I = InitialI;

UpdateState(State, *I);
}
for (;;) {
bool Expired = false;
for (auto E = MBB->instr_rend(); I != E; ++I) {
// No need to look at parent BUNDLE instructions.
if (I->isBundle())
continue;

for (MachineBasicBlock *Pred : MBB->predecessors()) {
if (!Visited.insert(Pred).second)
continue;
auto Result = IsHazard(State, *I);
if (Result == HazardFound)
return true;
if (Result == HazardExpired) {
Expired = true;
break;
}

if (hasHazard(State, IsHazard, UpdateState, Pred, Pred->instr_rbegin(),
Visited))
return true;
if (I->isInlineAsm() || I->isMetaInstruction())
continue;

UpdateState(State, *I);
}

if (!Expired) {
unsigned StateIdx = ResolveStateIdx(State);
for (MachineBasicBlock *Pred : MBB->predecessors()) {
if (!Visited.insert(std::pair(Pred, StateIdx)).second)
continue;
Worklist.emplace_back(Pred, StateIdx);
}
}

if (Worklist.empty())
break;

unsigned StateIdx;
std::tie(MBB, StateIdx) = Worklist.pop_back_val();
State = States[StateIdx];
I = MBB->instr_rbegin();
}

return false;
Expand Down Expand Up @@ -1623,6 +1677,14 @@ bool GCNHazardRecognizer::fixVALUPartialForwardingHazard(MachineInstr *MI) {
SmallDenseMap<Register, int, 4> DefPos;
int ExecPos = std::numeric_limits<int>::max();
int VALUs = 0;

unsigned getHashValue() const {
return hash_combine(ExecPos, VALUs, hash_combine_range(DefPos));
}
static bool isEqual(const StateType &LHS, const StateType &RHS) {
return LHS.DefPos == RHS.DefPos && LHS.ExecPos == RHS.ExecPos &&
LHS.VALUs == RHS.VALUs;
}
};

StateType State;
Expand Down Expand Up @@ -1717,9 +1779,8 @@ bool GCNHazardRecognizer::fixVALUPartialForwardingHazard(MachineInstr *MI) {
State.VALUs += 1;
};

DenseSet<const MachineBasicBlock *> Visited;
if (!hasHazard<StateType>(State, IsHazardFn, UpdateStateFn, MI->getParent(),
std::next(MI->getReverseIterator()), Visited))
std::next(MI->getReverseIterator())))
return false;

BuildMI(*MI->getParent(), MI, MI->getDebugLoc(),
Expand Down Expand Up @@ -1760,6 +1821,11 @@ bool GCNHazardRecognizer::fixVALUTransUseHazard(MachineInstr *MI) {
struct StateType {
int VALUs = 0;
int TRANS = 0;

unsigned getHashValue() const { return hash_combine(VALUs, TRANS); }
static bool isEqual(const StateType &LHS, const StateType &RHS) {
return LHS.VALUs == RHS.VALUs && LHS.TRANS == RHS.TRANS;
}
};

StateType State;
Expand Down Expand Up @@ -1795,9 +1861,8 @@ bool GCNHazardRecognizer::fixVALUTransUseHazard(MachineInstr *MI) {
State.TRANS += 1;
};

DenseSet<const MachineBasicBlock *> Visited;
if (!hasHazard<StateType>(State, IsHazardFn, UpdateStateFn, MI->getParent(),
std::next(MI->getReverseIterator()), Visited))
std::next(MI->getReverseIterator())))
return false;

// Hazard is observed - insert a wait on va_dst counter to ensure hazard is
Expand Down
Loading