diff options
Diffstat (limited to 'compiler/dex')
| -rw-r--r-- | compiler/dex/global_value_numbering_test.cc | 6 | ||||
| -rw-r--r-- | compiler/dex/gvn_dead_code_elimination_test.cc | 2 | ||||
| -rw-r--r-- | compiler/dex/mir_graph.cc | 6 | ||||
| -rw-r--r-- | compiler/dex/mir_graph.h | 2 | ||||
| -rw-r--r-- | compiler/dex/mir_graph_test.cc | 2 | ||||
| -rw-r--r-- | compiler/dex/mir_optimization_test.cc | 4 | ||||
| -rw-r--r-- | compiler/dex/type_inference_test.cc | 2 |
7 files changed, 12 insertions, 12 deletions
diff --git a/compiler/dex/global_value_numbering_test.cc b/compiler/dex/global_value_numbering_test.cc index c8aa9902c3..f2c2e22d6a 100644 --- a/compiler/dex/global_value_numbering_test.cc +++ b/compiler/dex/global_value_numbering_test.cc @@ -202,7 +202,7 @@ class GlobalValueNumberingTest : public testing::Test { for (size_t j = 0u; j != def->num_successors; ++j) { SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = j; successor_block_info->key = 0u; // Not used by class init check elimination. bb->successor_blocks.push_back(successor_block_info); @@ -474,7 +474,7 @@ GlobalValueNumberingTestCatch::GlobalValueNumberingTestCatch() BasicBlock* check_bb = cu_.mir_graph->GetBasicBlock(3u); check_bb->successor_block_list_type = kCatch; SuccessorBlockInfo* successor_block_info = reinterpret_cast<SuccessorBlockInfo*> - (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessor)); + (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessors)); successor_block_info->block = catch_handler->id; check_bb->successor_blocks.push_back(successor_block_info); } @@ -2284,7 +2284,7 @@ TEST_F(GlobalValueNumberingTest, NormalPathToCatchEntry) { BasicBlock* check_bb = cu_.mir_graph->GetBasicBlock(3u); check_bb->successor_block_list_type = kCatch; SuccessorBlockInfo* successor_block_info = reinterpret_cast<SuccessorBlockInfo*> - (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessor)); + (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessors)); successor_block_info->block = catch_handler->id; check_bb->successor_blocks.push_back(successor_block_info); BasicBlock* merge_block = cu_.mir_graph->GetBasicBlock(4u); diff --git a/compiler/dex/gvn_dead_code_elimination_test.cc b/compiler/dex/gvn_dead_code_elimination_test.cc index 4df0a8b98d..28c61a8fca 100644 --- a/compiler/dex/gvn_dead_code_elimination_test.cc +++ b/compiler/dex/gvn_dead_code_elimination_test.cc @@ -209,7 +209,7 @@ class GvnDeadCodeEliminationTest : public testing::Test { for (size_t j = 0u; j != def->num_successors; ++j) { SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = j; successor_block_info->key = 0u; // Not used by class init check elimination. bb->successor_blocks.push_back(successor_block_info); diff --git a/compiler/dex/mir_graph.cc b/compiler/dex/mir_graph.cc index 38342420ac..40600558ac 100644 --- a/compiler/dex/mir_graph.cc +++ b/compiler/dex/mir_graph.cc @@ -572,7 +572,7 @@ BasicBlock* MIRGraph::ProcessCanSwitch(BasicBlock* cur_block, MIR* insn, DexOffs DCHECK(case_block != nullptr); SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(arena_->Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = case_block->id; successor_block_info->key = (insn->dalvikInsn.opcode == Instruction::PACKED_SWITCH) ? @@ -627,7 +627,7 @@ BasicBlock* MIRGraph::ProcessCanThrow(BasicBlock* cur_block, MIR* insn, DexOffse catches_.insert(catch_block->start_offset); } SuccessorBlockInfo* successor_block_info = reinterpret_cast<SuccessorBlockInfo*> - (arena_->Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessor)); + (arena_->Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessors)); successor_block_info->block = catch_block->id; successor_block_info->key = iterator.GetHandlerTypeIndex(); cur_block->successor_blocks.push_back(successor_block_info); @@ -2177,7 +2177,7 @@ BasicBlock* BasicBlock::Copy(MIRGraph* mir_graph) { result_bb->successor_blocks.reserve(successor_blocks.size()); for (SuccessorBlockInfo* sbi_old : successor_blocks) { SuccessorBlockInfo* sbi_new = static_cast<SuccessorBlockInfo*>( - arena->Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessor)); + arena->Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessors)); memcpy(sbi_new, sbi_old, sizeof(SuccessorBlockInfo)); result_bb->successor_blocks.push_back(sbi_new); } diff --git a/compiler/dex/mir_graph.h b/compiler/dex/mir_graph.h index bcfd4405cb..29f772d267 100644 --- a/compiler/dex/mir_graph.h +++ b/compiler/dex/mir_graph.h @@ -379,7 +379,7 @@ class BasicBlock : public DeletableArenaObject<kArenaAllocBasicBlock> { terminated_by_return(), dominates_return(), use_lvn(), first_mir_insn(), last_mir_insn(), data_flow_info(), dominators(), i_dominated(), dom_frontier(), predecessors(allocator->Adapter(kArenaAllocBBPredecessors)), - successor_blocks(allocator->Adapter(kArenaAllocSuccessor)) { + successor_blocks(allocator->Adapter(kArenaAllocSuccessors)) { } BasicBlockId id; BasicBlockId dfs_id; diff --git a/compiler/dex/mir_graph_test.cc b/compiler/dex/mir_graph_test.cc index 49b7511b42..7858681e00 100644 --- a/compiler/dex/mir_graph_test.cc +++ b/compiler/dex/mir_graph_test.cc @@ -79,7 +79,7 @@ class TopologicalSortOrderTest : public testing::Test { for (size_t j = 0u; j != def->num_successors; ++j) { SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = j; successor_block_info->key = 0u; // Not used by class init check elimination. bb->successor_blocks.push_back(successor_block_info); diff --git a/compiler/dex/mir_optimization_test.cc b/compiler/dex/mir_optimization_test.cc index 47123ba28c..a0cedff9b8 100644 --- a/compiler/dex/mir_optimization_test.cc +++ b/compiler/dex/mir_optimization_test.cc @@ -118,7 +118,7 @@ class MirOptimizationTest : public testing::Test { for (size_t j = 0u; j != def->num_successors; ++j) { SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = j; successor_block_info->key = 0u; // Not used by class init check elimination. bb->successor_blocks.push_back(successor_block_info); @@ -244,7 +244,7 @@ class MirOptimizationTest : public testing::Test { BasicBlock* check_bb = cu_.mir_graph->GetBasicBlock(3u); check_bb->successor_block_list_type = kCatch; SuccessorBlockInfo* successor_block_info = reinterpret_cast<SuccessorBlockInfo*> - (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessor)); + (cu_.arena.Alloc(sizeof(SuccessorBlockInfo), kArenaAllocSuccessors)); successor_block_info->block = catch_handler->id; check_bb->successor_blocks.push_back(successor_block_info); } diff --git a/compiler/dex/type_inference_test.cc b/compiler/dex/type_inference_test.cc index eaa2bfac93..669963cb03 100644 --- a/compiler/dex/type_inference_test.cc +++ b/compiler/dex/type_inference_test.cc @@ -321,7 +321,7 @@ class TypeInferenceTest : public testing::Test { for (size_t j = 0u; j != def->num_successors; ++j) { SuccessorBlockInfo* successor_block_info = static_cast<SuccessorBlockInfo*>(cu_.arena.Alloc(sizeof(SuccessorBlockInfo), - kArenaAllocSuccessor)); + kArenaAllocSuccessors)); successor_block_info->block = j; successor_block_info->key = 0u; // Not used by class init check elimination. bb->successor_blocks.push_back(successor_block_info); |