diff options
| author | Andreas Gampe <agampe@google.com> | 2014-12-04 17:24:50 -0800 |
|---|---|---|
| committer | Andreas Gampe <agampe@google.com> | 2014-12-04 17:24:50 -0800 |
| commit | 0418b5b20587c645b6bf9d8cb65d3d6a9f074d96 (patch) | |
| tree | f0f7d8a245851acd0409535640a804be5db7a6bb /compiler/optimizing/bounds_check_elimination_test.cc | |
| parent | 044ac4f4f6760eeef4ed96b5349a8a5c325c52f1 (diff) | |
| download | art-0418b5b20587c645b6bf9d8cb65d3d6a9f074d96.zip art-0418b5b20587c645b6bf9d8cb65d3d6a9f074d96.tar.gz art-0418b5b20587c645b6bf9d8cb65d3d6a9f074d96.tar.bz2 | |
ART: Fix linting errors
Fix bounds_check_elimination linting errors.
Change-Id: I040433ecbc84d740bff331c37df0bfcc64dc244e
Diffstat (limited to 'compiler/optimizing/bounds_check_elimination_test.cc')
| -rw-r--r-- | compiler/optimizing/bounds_check_elimination_test.cc | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/compiler/optimizing/bounds_check_elimination_test.cc b/compiler/optimizing/bounds_check_elimination_test.cc index 5e2e62c..f650ff2 100644 --- a/compiler/optimizing/bounds_check_elimination_test.cc +++ b/compiler/optimizing/bounds_check_elimination_test.cc @@ -188,10 +188,10 @@ TEST(BoundsCheckEliminationTest, OverflowArrayBoundsElimination) { HBasicBlock* exit = new (&allocator) HBasicBlock(graph); graph->AddBlock(exit); exit->AddInstruction(new (&allocator) HExit()); - block1->AddSuccessor(exit); // true successor - block1->AddSuccessor(block2); // false successor - block2->AddSuccessor(exit); // true successor - block2->AddSuccessor(block3); // false successor + block1->AddSuccessor(exit); // true successor + block1->AddSuccessor(block2); // false successor + block2->AddSuccessor(exit); // true successor + block2->AddSuccessor(block3); // false successor block3->AddSuccessor(exit); graph->BuildDominatorTree(); @@ -263,10 +263,10 @@ TEST(BoundsCheckEliminationTest, UnderflowArrayBoundsElimination) { HBasicBlock* exit = new (&allocator) HBasicBlock(graph); graph->AddBlock(exit); exit->AddInstruction(new (&allocator) HExit()); - block1->AddSuccessor(exit); // true successor - block1->AddSuccessor(block2); // false successor - block2->AddSuccessor(exit); // true successor - block2->AddSuccessor(block3); // false successor + block1->AddSuccessor(exit); // true successor + block1->AddSuccessor(block2); // false successor + block2->AddSuccessor(exit); // true successor + block2->AddSuccessor(block3); // false successor block3->AddSuccessor(exit); graph->BuildDominatorTree(); |