diff options
| author | Misha Brukman <brukman+llvm@gmail.com> | 2003-09-17 21:34:23 +0000 |
|---|---|---|
| committer | Misha Brukman <brukman+llvm@gmail.com> | 2003-09-17 21:34:23 +0000 |
| commit | 02fe6b7683144bad0b8446c20cb8b83e47cf29b6 (patch) | |
| tree | f264a3d230e790dbb644eb58a73f1c2770ea4569 /llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp | |
| parent | a2748c267b92d435a27ba3d17fa55d67ef37d9b2 (diff) | |
| download | bcm5719-llvm-02fe6b7683144bad0b8446c20cb8b83e47cf29b6.tar.gz bcm5719-llvm-02fe6b7683144bad0b8446c20cb8b83e47cf29b6.zip | |
Fixed spelling.
llvm-svn: 8588
Diffstat (limited to 'llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp')
| -rw-r--r-- | llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp b/llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp index 392ae04d689..cf4f2941557 100644 --- a/llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp +++ b/llvm/lib/CodeGen/InstrSched/InstrScheduling.cpp @@ -1060,7 +1060,7 @@ NodeCanFillDelaySlot(const SchedulingManager& S, 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 @@ MarkNodeForDelaySlot(SchedulingManager& S, 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); |
