diff options
author | Andrew Trick <atrick@apple.com> | 2012-03-07 05:21:36 +0000 |
---|---|---|
committer | Andrew Trick <atrick@apple.com> | 2012-03-07 05:21:36 +0000 |
commit | 4c727204271067f3dbf50bd23098b2df8e1cc47a (patch) | |
tree | 38df07d4b2485a2cae5ecc559b219f1b692f88b6 /lib/CodeGen/ScheduleDAG.cpp | |
parent | dbdca36af8ee6028dbea93c639408ba95e5fda2e (diff) | |
download | llvm-4c727204271067f3dbf50bd23098b2df8e1cc47a.tar.gz llvm-4c727204271067f3dbf50bd23098b2df8e1cc47a.tar.bz2 llvm-4c727204271067f3dbf50bd23098b2df8e1cc47a.tar.xz |
misched preparation: modularize schedule verification.
ScheduleDAG will not refer to the scheduled instruction sequence.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152204 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/ScheduleDAG.cpp')
-rw-r--r-- | lib/CodeGen/ScheduleDAG.cpp | 13 |
1 files changed, 4 insertions, 9 deletions
diff --git a/lib/CodeGen/ScheduleDAG.cpp b/lib/CodeGen/ScheduleDAG.cpp index 94b28b6c5b..de8f5199eb 100644 --- a/lib/CodeGen/ScheduleDAG.cpp +++ b/lib/CodeGen/ScheduleDAG.cpp @@ -346,13 +346,12 @@ void SUnit::dumpAll(const ScheduleDAG *G) const { } #ifndef NDEBUG -/// VerifySchedule - Verify that all SUnits were scheduled and that -/// their state is consistent. +/// VerifyScheduledDAG - Verify that all SUnits were scheduled and that +/// their state is consistent. Return the number of scheduled nodes. /// -void ScheduleDAG::VerifySchedule(bool isBottomUp) { +unsigned ScheduleDAG::VerifyScheduledDAG(bool isBottomUp) { bool AnyNotSched = false; unsigned DeadNodes = 0; - unsigned Noops = 0; for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { if (!SUnits[i].isScheduled) { if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { @@ -393,12 +392,8 @@ void ScheduleDAG::VerifySchedule(bool isBottomUp) { } } } - for (unsigned i = 0, e = Sequence.size(); i != e; ++i) - if (!Sequence[i]) - ++Noops; assert(!AnyNotSched); - assert(Sequence.size() + DeadNodes - Noops == SUnits.size() && - "The number of nodes scheduled doesn't match the expected number!"); + return SUnits.size() - DeadNodes; } #endif |