diff options
author | Craig Topper <craig.topper@intel.com> | 2019-04-30 17:56:47 +0000 |
---|---|---|
committer | Craig Topper <craig.topper@intel.com> | 2019-04-30 17:56:47 +0000 |
commit | 3958719ddafb7459b35ae44255c41940086317a4 (patch) | |
tree | ef6774d339adecd8ad1178d76a52f4f071f38bec /llvm/lib | |
parent | 965d1306ae42159116df160974847d9d63941018 (diff) | |
download | bcm5719-llvm-3958719ddafb7459b35ae44255c41940086317a4.tar.gz bcm5719-llvm-3958719ddafb7459b35ae44255c41940086317a4.zip |
[X86] If PreprocessISelDAG reorders a load before a call, make sure we remove dead nodes from the graph
The reordering can leave at least a dead TokenFactor in the graph. This cause the linearize scheduler to fail with something like the assert seen in PR22614. This is only one of many ways we can break the linearize scheduler today so I can't say for sure that any of the other failures in that bug were caused by this issue.
This takes the heavy hammer approach of just running RemoveDeadNodes unconditionally at the end of the PreprocessISelDAG. If this turns out to be a compile time hit, we can try to refine it.
Differential Revision: https://reviews.llvm.org/D61164
llvm-svn: 359582
Diffstat (limited to 'llvm/lib')
-rw-r--r-- | llvm/lib/Target/X86/X86ISelDAGToDAG.cpp | 5 |
1 files changed, 5 insertions, 0 deletions
diff --git a/llvm/lib/Target/X86/X86ISelDAGToDAG.cpp b/llvm/lib/Target/X86/X86ISelDAGToDAG.cpp index c16fbe03ec5..450872d8619 100644 --- a/llvm/lib/Target/X86/X86ISelDAGToDAG.cpp +++ b/llvm/lib/Target/X86/X86ISelDAGToDAG.cpp @@ -907,6 +907,11 @@ void X86DAGToDAGISel::PreprocessISelDAG() { ++I; CurDAG->DeleteNode(N); } + + // The load+call transform above can leave some dead nodes in the graph. Make + // sure we remove them. Its possible some of the other transforms do to so + // just remove dead nodes unconditionally. + CurDAG->RemoveDeadNodes(); } // Look for a redundant movzx/movsx that can occur after an 8-bit divrem. |