Magic-Mirror/llvm-capstone
1
0
Fork 0
mirror of https://github.com/capstone-engine/llvm-capstone.git synced 2024-12-03 19:32:35 +00:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

[RDF] Minor refactoring for clarity, NFC

Browse Source
This commit is contained in:
Krzysztof Parzyszek 2023-06-06 12:34:40 -07:00
parent 198d647fad
commit 3eeebfe83b
1 changed files with 17 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
llvm/lib/CodeGen/RDFGraph.cpp
View File

@ -1119,7 +1119,7 @@ void DataFlowGraph::reset() {
Ref DataFlowGraph::getNextRelated(Instr IA, Ref RA) const {
assert(IA.Id != 0 && RA.Id != 0);
auto Related = [this, RA](Ref TA) -> bool {
auto IsRelated = [this, RA](Ref TA) -> bool {
if (TA.Addr->getKind() != RA.Addr->getKind())
return false;
if (!getPRI().equal_to(TA.Addr->getRegRef(*this),
@ -1128,24 +1128,26 @@ Ref DataFlowGraph::getNextRelated(Instr IA, Ref RA) const {
}
return true;
};
auto RelatedStmt = [&Related, RA](Ref TA) -> bool {
return Related(TA) && &RA.Addr->getOp() == &TA.Addr->getOp();
};
auto RelatedPhi = [&Related, RA](Ref TA) -> bool {
if (!Related(TA))
RegisterRef RR = RA.Addr->getRegRef(*this);
if (IA.Addr->getKind() == NodeAttrs::Stmt) {
auto Cond = [&IsRelated, RA](Ref TA) -> bool {
return IsRelated(TA) && &RA.Addr->getOp() == &TA.Addr->getOp();
};
return RA.Addr->getNextRef(RR, Cond, true, *this);
}
assert(IA.Addr->getKind() == NodeAttrs::Phi);
auto Cond = [&IsRelated, RA](Ref TA) -> bool {
if (!IsRelated(TA))
return false;
if (TA.Addr->getKind() != NodeAttrs::Use)
return true;
// For phi uses, compare predecessor blocks.
const NodeAddr<const PhiUseNode *> TUA = TA;
const NodeAddr<const PhiUseNode *> RUA = RA;
return TUA.Addr->getPredecessor() == RUA.Addr->getPredecessor();
return PhiUse(TA).Addr->getPredecessor() ==
PhiUse(RA).Addr->getPredecessor();
};
RegisterRef RR = RA.Addr->getRegRef(*this);
if (IA.Addr->getKind() == NodeAttrs::Stmt)
return RA.Addr->getNextRef(RR, RelatedStmt, true, *this);
return RA.Addr->getNextRef(RR, RelatedPhi, true, *this);
return RA.Addr->getNextRef(RR, Cond, true, *this);
}
// Find the next node related to RA in IA that satisfies condition P.
@ -1571,8 +1573,7 @@ void DataFlowGraph::linkBlockRefs(DefStackMap &DefM, Block BA) {
if (NA.Addr->getKind() != NodeAttrs::Use)
return false;
assert(NA.Addr->getFlags() & NodeAttrs::PhiRef);
PhiUse PUA = NA;
return PUA.Addr->getPredecessor() == BA.Id;
return PhiUse(NA).Addr->getPredecessor() == BA.Id;
};
RegisterAggr EHLiveIns = getLandingPadLiveIns();