[llvm-commits] CVS: llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp

[Misha Brukman]

Changes in directory llvm/lib/CodeGen/InstrSched:

InstrScheduling.cpp updated: 1.58 -> 1.59

---
Log message:

Fixed spelling.


---
Diffs of the changes:

Index: llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp
diff -u llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp:1.58 llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp:1.59
--- llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp:1.58	Tue Sep 16 00:55:15 2003
+++ llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp	Wed Sep 17 16:33:36 2003
@@ -1060,7 +1060,7 @@
   if (! S.getInstrInfo().hasOperandInterlock(node->getOpCode()))
     return false;
   
-  // Finally, if the instruction preceeds the branch, we make sure the
+  // Finally, if the instruction precedes the branch, we make sure the
   // instruction can be reordered relative to the branch.  We simply check
   // if the instr. has only 1 outgoing edge, viz., a CD edge to the branch.
   // 
@@ -1092,7 +1092,7 @@
 		     bool nodeIsPredecessor)
 {
   if (nodeIsPredecessor) {
-    // If node is in the same basic block (i.e., preceeds brNode),
+    // If node is in the same basic block (i.e., precedes brNode),
     // remove it and all its incident edges from the graph.  Make sure we
     // add dummy edges for pred/succ nodes that become entry/exit nodes.
     graph->eraseIncidentEdges(node, /*addDummyEdges*/ true);