diff options
author | Matthias Braun <matze@braunis.de> | 2018-07-26 17:43:56 +0000 |
---|---|---|
committer | Matthias Braun <matze@braunis.de> | 2018-07-26 17:43:56 +0000 |
commit | 09810c9269dce1745f81601d364b9aeea286c200 (patch) | |
tree | 97d67ae73591e436c5209cbd139eaa6890724f12 /llvm/lib/CodeGen/MacroFusion.cpp | |
parent | 1eee1b771f43761e39c1e3bc9e0c31b078290240 (diff) | |
download | bcm5719-llvm-09810c9269dce1745f81601d364b9aeea286c200.tar.gz bcm5719-llvm-09810c9269dce1745f81601d364b9aeea286c200.zip |
MacroFusion: Fix macro fusion with ExitSU failing in top-down scheduling
When fusing instructions A and B, we must add all predecessors of B as
predecessors of A to avoid instructions getting scheduling in between.
There is a special case involving ExitSU: Every other node must be
scheduled before it by design and we don't need to make this explicit in
the graph, however when fusing with a different node we need to schedule
every othere node before the fused node too and we need to make this
explicit now: This patch adds a dependency from the fused node to all
roots in the graph.
Differential Revision: https://reviews.llvm.org/D49830
llvm-svn: 338046
Diffstat (limited to 'llvm/lib/CodeGen/MacroFusion.cpp')
-rw-r--r-- | llvm/lib/CodeGen/MacroFusion.cpp | 12 |
1 files changed, 11 insertions, 1 deletions
diff --git a/llvm/lib/CodeGen/MacroFusion.cpp b/llvm/lib/CodeGen/MacroFusion.cpp index 2df72d83aaf..62dadbba0c1 100644 --- a/llvm/lib/CodeGen/MacroFusion.cpp +++ b/llvm/lib/CodeGen/MacroFusion.cpp @@ -87,7 +87,7 @@ static bool fuseInstructionPair(ScheduleDAGMI &DAG, SUnit &FirstSU, // Make the FirstSU also dependent on the dependencies of the SecondSU to // prevent them from being scheduled between the FirstSU and the SecondSU. - if (&FirstSU != &DAG.EntrySU) + if (&FirstSU != &DAG.EntrySU) { for (const SDep &SI : SecondSU.Preds) { SUnit *SU = SI.getSUnit(); if (SI.isWeak() || isHazard(SI) || &FirstSU == SU || FirstSU.isSucc(SU)) @@ -96,6 +96,16 @@ static bool fuseInstructionPair(ScheduleDAGMI &DAG, SUnit &FirstSU, FirstSU.print(dbgs(), &DAG); dbgs() << '\n';); DAG.addEdge(&FirstSU, SDep(SU, SDep::Artificial)); } + // ExitSU comes last by design, which acts like an implicit dependency + // between ExitSU and any bottom root in the graph. We should transfer + // this to FirstSU as well. + if (&SecondSU == &DAG.ExitSU) { + for (SUnit &SU : DAG.SUnits) { + if (SU.Succs.empty()) + DAG.addEdge(&FirstSU, SDep(&SU, SDep::Artificial)); + } + } + } ++NumFused; return true; |