RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-14 07:31:53 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

remove function names from comments; NFC

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@227256 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Sanjay Patel 2015-01-27 22:26:56 +00:00
parent 4990e83b7b
commit c232e7f8fb
1 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/CodeGen/MachineCombiner.cpp
View File

@ -45,7 +45,7 @@ class MachineCombiner : public MachineFunctionPass {
TargetSchedModel TSchedModel; TargetSchedModel TSchedModel;
/// OptSize - True if optimizing for code size. /// True if optimizing for code size.
bool OptSize; bool OptSize;
public: public:
@ -109,7 +109,7 @@ MachineInstr *MachineCombiner::getOperandDef(const MachineOperand &MO) {
return DefInstr; return DefInstr;
} }
/// getDepth - Computes depth of instructions in vector \InsInstr. /// Computes depth of instructions in vector \InsInstr.
/// ///
/// \param InsInstrs is a vector of machine instructions /// \param InsInstrs is a vector of machine instructions
/// \param InstrIdxForVirtReg is a dense map of virtual register to index /// \param InstrIdxForVirtReg is a dense map of virtual register to index
@ -169,8 +169,7 @@ MachineCombiner::getDepth(SmallVectorImpl<MachineInstr *> &InsInstrs,
return InstrDepth[NewRootIdx]; return InstrDepth[NewRootIdx];
} }
/// getLatency - Computes instruction latency as max of latency of defined /// Computes instruction latency as max of latency of defined operands.
/// operands
/// ///
/// \param Root is a machine instruction that could be replaced by NewRoot. /// \param Root is a machine instruction that could be replaced by NewRoot.
/// It is used to compute a more accurate latency information for NewRoot in /// It is used to compute a more accurate latency information for NewRoot in
@ -211,7 +210,7 @@ unsigned MachineCombiner::getLatency(MachineInstr *Root, MachineInstr *NewRoot,
return NewRootLatency; return NewRootLatency;
} }
/// preservesCriticalPathlen - True when the new instruction sequence does not /// True when the new instruction sequence does not
/// 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
@ -264,8 +263,7 @@ void MachineCombiner::instr2instrSC(
InstrsSC.push_back(SC); InstrsSC.push_back(SC);
} }
} }
/// preservesResourceLen - True when the new instructions do not increase /// True when the new instructions do not increase resource length
/// resource length
bool MachineCombiner::preservesResourceLen( bool MachineCombiner::preservesResourceLen(
MachineBasicBlock *MBB, MachineTraceMetrics::Trace BlockTrace, MachineBasicBlock *MBB, MachineTraceMetrics::Trace BlockTrace,
SmallVectorImpl<MachineInstr *> &InsInstrs, SmallVectorImpl<MachineInstr *> &InsInstrs,
@ -309,7 +307,7 @@ bool MachineCombiner::doSubstitute(unsigned NewSize, unsigned OldSize) {
return false; return false;
} }
/// combineInstructions - substitute a slow code sequence with a faster one by /// Substitute a slow code sequence with a faster one by
/// evaluating instruction combining pattern. /// evaluating instruction combining pattern.
/// The prototype of such a pattern is MUl + ADD -> MADD. Performs instruction /// The prototype of such a pattern is MUl + ADD -> MADD. Performs instruction
/// combining based on machine trace metrics. Only combine a sequence of /// combining based on machine trace metrics. Only combine a sequence of