Fixed bug with infinite epilogues.

Fixed issue with generating the partial order. It now adds the nodes not in recurrences in sets for each connected component.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17351 91177308-0d34-0410-b5e6-96231b3b80d8

1 files changed, 4 insertions, 3 deletions

diff --git a/lib/Target/SparcV9/ModuloScheduling/MSchedGraph.h b/lib/Target/SparcV9/ModuloScheduling/MSchedGraph.h
index 4ea572a380..baa6373510 100644
--- a/lib/Target/SparcV9/ModuloScheduling/MSchedGraph.h
+++ b/lib/Target/SparcV9/ModuloScheduling/MSchedGraph.h
@@ -21,6 +21,7 @@
 #include "llvm/ADT/iterator"
 #include <vector>
 
+
 namespace llvm {
   class MSchedGraph;
   class MSchedGraphNode;
@@ -99,7 +100,9 @@ namespace llvm {
     MSchedGraph* getParent() { return Parent; }
     bool hasPredecessors() { return (Predecessors.size() > 0); }
     bool hasSuccessors() { return (Successors.size() > 0); }
-    int getLatency() { return latency; }
+    unsigned getLatency() { return latency; }
+    unsigned getLatency() const { return latency; }
+
     MSchedGraphEdge getInEdge(MSchedGraphNode *pred);
     unsigned getInEdgeNum(MSchedGraphNode *pred);
 
@@ -309,8 +312,6 @@ namespace llvm {
   };
 
 
-
-
 }
 
 #endif