File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -210,7 +210,7 @@ bool X86CmovConverterPass::runOnMachineFunction(MachineFunction &MF) {
210
210
// ===--------------------------------------------------------------------===//
211
211
// Register-operand Conversion Algorithm
212
212
// ---------
213
- // For each inner most loop
213
+ // For each innermost loop
214
214
// collectCmovCandidates() {
215
215
// Find all CMOV-group-candidates.
216
216
// }
@@ -239,7 +239,7 @@ bool X86CmovConverterPass::runOnMachineFunction(MachineFunction &MF) {
239
239
Loops.push_back (Child);
240
240
241
241
for (MachineLoop *CurrLoop : Loops) {
242
- // Optimize only inner most loops.
242
+ // Optimize only innermost loops.
243
243
if (!CurrLoop->getSubLoops ().empty ())
244
244
continue ;
245
245
@@ -529,7 +529,7 @@ bool X86CmovConverterPass::checkForProfitableCmovCandidates(
529
529
// ===--------------------------------------------------------------------===//
530
530
// Step 3: Check for each CMOV-group-candidate if it worth to be optimized.
531
531
// Worth-Optimize-Group:
532
- // Iff it worths to optimize all CMOV instructions in the group.
532
+ // Iff it is worth to optimize all CMOV instructions in the group.
533
533
//
534
534
// Worth-Optimize-CMOV:
535
535
// Predicted branch is faster than CMOV by the difference between depth of
You can’t perform that action at this time.
0 commit comments