diff options
| author | 2016-03-23 16:44:08 +0000 | |
|---|---|---|
| committer | 2016-03-23 16:44:08 +0000 | |
| commit | f8a3dea642fe638f54d181b7ca280b79ee519398 (patch) | |
| tree | 00a4b12cac09c7ba84db7508ce22ab1fd939c571 /compiler/optimizing/nodes.cc | |
| parent | 7ee5bc54fbe1bf5218696e63a80e76cd0c8ea387 (diff) | |
| parent | c9b21f83c2eab8bdd16241992193c3049dc68e43 (diff) | |
Merge "Fix some typos in art/compiler/optimizing/nodes.cc."
Diffstat (limited to 'compiler/optimizing/nodes.cc')
| -rw-r--r-- | compiler/optimizing/nodes.cc | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/compiler/optimizing/nodes.cc b/compiler/optimizing/nodes.cc index c83340b1f6..e08e8fb7b6 100644 --- a/compiler/optimizing/nodes.cc +++ b/compiler/optimizing/nodes.cc @@ -162,7 +162,7 @@ GraphAnalysisResult HGraph::BuildDominatorTree() { // (6) Compute the dominance information and the reverse post order. ComputeDominanceInformation(); - // (7) Analyze loops discover through back edge analysis, and + // (7) Analyze loops discovered through back edge analysis, and // set the loop information on each block. GraphAnalysisResult result = AnalyzeLoops(); if (result != kAnalysisSuccess) { @@ -247,7 +247,7 @@ void HGraph::ComputeDominanceInformation() { } // Populate `dominated_blocks_` information after computing all dominators. - // The potential presence of irreducible loops require to do it after. + // The potential presence of irreducible loops requires to do it after. for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { HBasicBlock* block = it.Current(); if (!block->IsEntryBlock()) { @@ -460,7 +460,7 @@ void HGraph::SimplifyCFG() { if (block->IsLoopHeader()) { SimplifyLoop(block); } else if (!block->IsEntryBlock() && block->GetFirstInstruction()->IsSuspendCheck()) { - // We are being called by the dead code elimiation pass, and what used to be + // We are being called by the dead code elimination pass, and what used to be // a loop got dismantled. Just remove the suspend check. block->RemoveInstruction(block->GetFirstInstruction()); } @@ -2373,7 +2373,7 @@ void HInstruction::RemoveEnvironmentUsers() { env_uses_.Clear(); } -// Returns an instruction with the opposite boolean value from 'cond'. +// Returns an instruction with the opposite Boolean value from 'cond'. HInstruction* HGraph::InsertOppositeCondition(HInstruction* cond, HInstruction* cursor) { ArenaAllocator* allocator = GetArena(); |