First version of SchedGraph common class and refactoring of SchedGraph.

[oota-llvm.git] / lib / CodeGen / InstrSched / InstrScheduling.cpp

diff --git a/lib/CodeGen/InstrSched/InstrScheduling.cpp b/lib/CodeGen/InstrSched/InstrScheduling.cpp
index ae19a0635e5e668b0764e34f5bc27fc8b44e17c8..00a6a557f2b8d92f88619e54806209d325cc32e7 100644 (file)
--- a/lib/CodeGen/InstrSched/InstrScheduling.cpp
+++ b/lib/CodeGen/InstrSched/InstrScheduling.cpp
@@ -1047,8 +1047,8 @@ NodeCanFillDelaySlot(const SchedulingManager& S,
   
   for (SchedGraphNode::const_iterator EI = node->beginInEdges();
        EI != node->endInEdges(); ++EI)
-    if (! (*EI)->getSrc()->isDummyNode()
-       && mii.isLoad((*EI)->getSrc()->getOpCode())
+    if (! ((SchedGraphNode*)(*EI)->getSrc())->isDummyNode()
+       && mii.isLoad(((SchedGraphNode*)(*EI)->getSrc())->getOpCode())
        && (*EI)->getDepType() == SchedGraphEdge::CtrlDep)
       return false;
   
@@ -1065,7 +1065,7 @@ NodeCanFillDelaySlot(const SchedulingManager& S,
     bool onlyCDEdgeToBranch = true;
     for (SchedGraphNode::const_iterator OEI = node->beginOutEdges();
          OEI != node->endOutEdges(); ++OEI)
-      if (! (*OEI)->getSink()->isDummyNode()
+      if (! ((SchedGraphNode*)(*OEI)->getSink())->isDummyNode()
           && ((*OEI)->getSink() != brNode
               || (*OEI)->getDepType() != SchedGraphEdge::CtrlDep))
       {