6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-03 13:31:05 +00:00
Code Issues Projects Releases Wiki Activity

fix typos; NFC

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@227253 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Sanjay Patel 2015-01-27 22:16:52 +00:00
parent c9baf3befb
commit 5d68306018
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/CodeGen/MachineCombiner.cpp
View File

@ -125,7 +125,7 @@ MachineCombiner::getDepth(SmallVectorImpl<MachineInstr *> &InsInstrs,
SmallVector<unsigned, 16> InstrDepth; SmallVector<unsigned, 16> InstrDepth;
assert(TSchedModel.hasInstrSchedModel() && "Missing machine model\n"); assert(TSchedModel.hasInstrSchedModel() && "Missing machine model\n");
// Foreach instruction in in the new sequence compute the depth based on the // For each instruction in the new sequence compute the depth based on the
// operands. Use the trace information when possible. For new operands which // operands. Use the trace information when possible. For new operands which
// are tracked in the InstrIdxForVirtReg map depth is looked up in InstrDepth // are tracked in the InstrIdxForVirtReg map depth is looked up in InstrDepth
for (auto *InstrPtr : InsInstrs) { // for each Use for (auto *InstrPtr : InsInstrs) { // for each Use
@ -215,8 +215,8 @@ unsigned MachineCombiner::getLatency(MachineInstr *Root, MachineInstr *NewRoot,
/// lengthen the critical path. The DAGCombine code sequence ends in MI /// lengthen the critical path. The DAGCombine code sequence ends in MI
/// (Machine Instruction) Root. The new code sequence ends in MI NewRoot. A /// (Machine Instruction) Root. The new code sequence ends in MI NewRoot. A
/// necessary condition for the new sequence to replace the old sequence is that /// necessary condition for the new sequence to replace the old sequence is that
/// is cannot lengthen the critical path. This is decided by the formula /// it cannot lengthen the critical path. This is decided by the formula
/// (NewRootDepth + NewRootLatency) <= (RootDepth + RootLatency + RootSlack)). /// (NewRootDepth + NewRootLatency) <= (RootDepth + RootLatency + RootSlack)).
/// The slack is the number of cycles Root can be delayed before the critical /// The slack is the number of cycles Root can be delayed before the critical
/// patch becomes longer. /// patch becomes longer.
bool MachineCombiner::preservesCriticalPathLen( bool MachineCombiner::preservesCriticalPathLen(
@ -300,7 +300,7 @@ bool MachineCombiner::preservesResourceLen(
} }
/// \returns true when new instruction sequence should be generated /// \returns true when new instruction sequence should be generated
/// independent if it lenghtens critical path or not /// independent if it lengthens critical path or not
bool MachineCombiner::doSubstitute(unsigned NewSize, unsigned OldSize) { bool MachineCombiner::doSubstitute(unsigned NewSize, unsigned OldSize) {
if (OptSize && (NewSize < OldSize)) if (OptSize && (NewSize < OldSize))
return true; return true;