[PATCH] D60839: [ScheduleDAGInstrs] Compute topological ordering on demand.
Florian Hahn via Phabricator via llvm-commits
llvm-commits at lists.llvm.org
Sun May 19 09:00:16 PDT 2019
fhahn updated this revision to Diff 200181.
fhahn marked 2 inline comments as done.
fhahn added a comment.
Remove unused MarkDirty.
Repository:
rG LLVM Github Monorepo
CHANGES SINCE LAST ACTION
https://reviews.llvm.org/D60839/new/
https://reviews.llvm.org/D60839
Files:
llvm/lib/CodeGen/ScheduleDAGInstrs.cpp
Index: llvm/lib/CodeGen/ScheduleDAGInstrs.cpp
===================================================================
--- llvm/lib/CodeGen/ScheduleDAGInstrs.cpp
+++ llvm/lib/CodeGen/ScheduleDAGInstrs.cpp
@@ -969,7 +969,7 @@
CurrentVRegDefs.clear();
CurrentVRegUses.clear();
- Topo.InitDAGTopologicalSorting();
+ Topo.MarkDirty();
}
raw_ostream &llvm::operator<<(raw_ostream &OS, const PseudoSourceValue* PSV) {
@@ -1158,7 +1158,7 @@
// If Pred is reachable from Succ, then the edge creates a cycle.
if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
return false;
- Topo.AddPred(SuccSU, PredDep.getSUnit());
+ Topo.AddPredQueued(SuccSU, PredDep.getSUnit());
}
SuccSU->addPred(PredDep, /*Required=*/!PredDep.isArtificial());
// Return true regardless of whether a new edge needed to be inserted.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: D60839.200181.patch
Type: text/x-patch
Size: 836 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20190519/8d68d564/attachment.bin>
More information about the llvm-commits
mailing list