| /art/compiler/optimizing/ |
| D | common_dominator.h | 37 explicit CommonDominator(HBasicBlock* block) in CommonDominator() argument
38 : dominator_(block), chain_length_(ChainLength(block)) { in CommonDominator()
42 void Update(HBasicBlock* block) { in Update() argument
43 DCHECK(block != nullptr); in Update()
45 dominator_ = block; in Update()
46 chain_length_ = ChainLength(block); in Update()
51 if (block == block2) { in Update()
54 size_t chain_length = ChainLength(block); in Update()
58 block = block->GetDominator(); in Update()
59 DCHECK(block != nullptr); in Update()
[all …]
|
| D | side_effects_analysis.cc | 29 for (HBasicBlock* block : graph_->GetReversePostOrder()) { in Run()
30 SideEffects effects = GetBlockEffects(block); in Run()
32 if (block->IsLoopHeader()) { in Run()
33 effects = GetLoopEffects(block); in Run()
40 for (HBasicBlock* block : graph_->GetPostOrder()) { in Run()
43 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done(); in Run()
54 block_effects_[block->GetBlockId()] = effects; in Run()
56 if (block->IsLoopHeader()) { in Run()
58 UpdateLoopEffects(block->GetLoopInformation(), effects); in Run()
59 HBasicBlock* pre_header = block->GetLoopInformation()->GetPreHeader(); in Run()
[all …]
|
| D | dead_code_elimination.cc | 39 HBasicBlock* block = worklist.back(); in MarkReachableBlocks() local
41 int block_id = block->GetBlockId(); in MarkReachableBlocks()
44 ArrayRef<HBasicBlock* const> live_successors(block->GetSuccessors()); in MarkReachableBlocks()
45 HInstruction* last_instruction = block->GetLastInstruction(); in MarkReachableBlocks()
72 DCHECK_EQ(live_successors[0], block->GetSuccessors()[switch_index]); in MarkReachableBlocks()
90 void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) { in MaybeRecordDeadBlock() argument
93 block->GetPhis().CountSize() + block->GetInstructions().CountSize()); in MaybeRecordDeadBlock()
149 static bool RemoveNonNullControlDependences(HBasicBlock* block, HBasicBlock* throws) { in RemoveNonNullControlDependences() argument
151 if (!block->EndsWithIf()) { in RemoveNonNullControlDependences()
154 HIf* ifs = block->GetLastInstruction()->AsIf(); in RemoveNonNullControlDependences()
[all …]
|
| D | block_builder.cc | 53 HBasicBlock* block = branch_targets_[store_dex_pc]; in MaybeCreateBlockAt() local
54 if (block == nullptr) { in MaybeCreateBlockAt()
55 block = new (allocator_) HBasicBlock(graph_, semantic_dex_pc); in MaybeCreateBlockAt()
56 branch_targets_[store_dex_pc] = block; in MaybeCreateBlockAt()
58 DCHECK_EQ(block->GetDexPc(), semantic_dex_pc); in MaybeCreateBlockAt()
59 return block; in MaybeCreateBlockAt()
147 HBasicBlock* block = graph_->GetEntryBlock(); in ConnectBasicBlocks() local
148 graph_->AddBlock(block); in ConnectBasicBlocks()
163 if (block != nullptr) { in ConnectBasicBlocks()
166 block->AddSuccessor(next_block); in ConnectBasicBlocks()
[all …]
|
| D | linear_order.cc | 41 HBasicBlock* block) { in AddToListForLinearization() argument
42 HLoopInformation* block_loop = block->GetLoopInformation(); in AddToListForLinearization()
54 worklist->insert(insert_pos.base(), block); in AddToListForLinearization()
66 for (HBasicBlock* block : linear_order) { in IsLinearOrderWellFormed()
67 if (loop->Contains(*block)) { in IsLinearOrderWellFormed()
69 if (found_blocks == 1u && block != header) { in IsLinearOrderWellFormed()
72 } else if (found_blocks == num_blocks && !loop->IsBackEdge(*block)) { in IsLinearOrderWellFormed()
100 for (HBasicBlock* block : graph->GetReversePostOrder()) { in LinearizeGraphInternal()
101 size_t number_of_forward_predecessors = block->GetPredecessors().size(); in LinearizeGraphInternal()
102 if (block->IsLoopHeader()) { in LinearizeGraphInternal()
[all …]
|
| D | gvn.cc | 372 void VisitBasicBlock(HBasicBlock* block);
378 ValueSet* FindSetFor(HBasicBlock* block) const { in FindSetFor()
379 ValueSet* result = sets_[block->GetBlockId()]; in FindSetFor()
380 DCHECK(result != nullptr) << "Could not find set for block B" << block->GetBlockId(); in FindSetFor()
384 void AbandonSetFor(HBasicBlock* block) { in AbandonSetFor() argument
385 DCHECK(sets_[block->GetBlockId()] != nullptr) in AbandonSetFor()
386 << "Block B" << block->GetBlockId() << " expected to have a set"; in AbandonSetFor()
387 sets_[block->GetBlockId()] = nullptr; in AbandonSetFor()
392 bool WillBeReferencedAgain(HBasicBlock* block) const;
397 HBasicBlock* FindVisitedBlockWithRecyclableSet(HBasicBlock* block,
[all …]
|
| D | ssa_liveness_analysis.cc | 48 for (HBasicBlock* block : graph_->GetLinearOrder()) { in NumberInstructions()
49 block->SetLifetimeStart(lifetime_position); in NumberInstructions()
51 for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.Advance()) { in NumberInstructions()
68 for (HInstructionIterator inst_it(block->GetInstructions()); !inst_it.Done(); in NumberInstructions()
84 block->SetLifetimeEnd(lifetime_position); in NumberInstructions()
90 for (HBasicBlock* block : graph_->GetLinearOrder()) { in ComputeLiveness()
91 block_infos_[block->GetBlockId()] = in ComputeLiveness()
92 new (allocator_) BlockInfo(allocator_, *block, number_of_ssa_values_); in ComputeLiveness()
171 for (HBasicBlock* block : ReverseRange(graph_->GetLinearOrder())) { in ComputeLiveRanges()
172 BitVector* kill = GetKillSet(*block); in ComputeLiveRanges()
[all …]
|
| D | gvn_test.cc | 40 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
41 graph->AddBlock(block); in TEST_F()
42 entry->AddSuccessor(block); in TEST_F()
44 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter, in TEST_F()
53 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter, in TEST_F()
62 HInstruction* to_remove = block->GetLastInstruction(); in TEST_F()
63 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter, in TEST_F()
72 HInstruction* different_offset = block->GetLastInstruction(); in TEST_F()
74 block->AddInstruction(new (GetAllocator()) HInstanceFieldSet(parameter, in TEST_F()
84 block->AddInstruction(new (GetAllocator()) HInstanceFieldGet(parameter, in TEST_F()
[all …]
|
| D | graph_test.cc | 48 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in CreateGotoBlock() local
49 graph->AddBlock(block); in CreateGotoBlock()
51 block->AddInstruction(got); in CreateGotoBlock()
52 return block; in CreateGotoBlock()
56 HBasicBlock* block = CreateGotoBlock(graph); in CreateEntryBlock() local
57 graph->SetEntryBlock(block); in CreateEntryBlock()
58 return block; in CreateEntryBlock()
62 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in CreateReturnBlock() local
63 graph->AddBlock(block); in CreateReturnBlock()
65 block->AddInstruction(return_instr); in CreateReturnBlock()
[all …]
|
| D | select_generator.cc | 35 static bool IsSimpleBlock(HBasicBlock* block) { in IsSimpleBlock() argument
36 if (block->GetPredecessors().size() != 1u) { in IsSimpleBlock()
39 DCHECK(block->GetPhis().IsEmpty()); in IsSimpleBlock()
42 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in IsSimpleBlock()
50 instruction->AsSelect()->GetCondition()->GetBlock() == block) { in IsSimpleBlock()
74 static HPhi* GetSingleChangedPhi(HBasicBlock* block, size_t index1, size_t index2) { in GetSingleChangedPhi() argument
78 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in GetSingleChangedPhi()
102 for (HBasicBlock* block : graph_->GetPostOrder()) { in Run()
103 if (!block->EndsWithIf()) continue; in Run()
106 HIf* if_instruction = block->GetLastInstruction()->AsIf(); in Run()
[all …]
|
| D | ssa_liveness_analysis_test.cc | 45 HBasicBlock* CreateSuccessor(HBasicBlock* block) { in CreateSuccessor() argument
46 HGraph* graph = block->GetGraph(); in CreateSuccessor()
49 block->AddSuccessor(successor); in CreateSuccessor()
64 HBasicBlock* block = CreateSuccessor(entry_); in TEST_F() local
66 block->AddInstruction(ret); in TEST_F()
67 block->AddInstruction(new (GetAllocator()) HExit()); in TEST_F()
95 HBasicBlock* block = CreateSuccessor(entry_); in TEST_F() local
97 block->AddInstruction(null_check); in TEST_F()
106 block->AddInstruction(length); in TEST_F()
108 block->AddInstruction(bounds_check); in TEST_F()
[all …]
|
| D | cha_guard_optimization.cc | 49 void VisitBasicBlock(HBasicBlock* block) override;
75 void CHAGuardVisitor::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock() argument
80 HInstructionIterator it(block->GetInstructions()); in VisitBasicBlock()
89 HBasicBlock* block = flag->GetBlock(); in RemoveGuard() local
100 block->RemoveInstruction(deopt); in RemoveGuard()
101 block->RemoveInstruction(compare); in RemoveGuard()
102 block->RemoveInstruction(flag); in RemoveGuard()
181 HBasicBlock* block = flag->GetBlock(); in HoistGuard() local
182 HLoopInformation* loop_info = block->GetLoopInformation(); in HoistGuard()
201 block->RemoveInstruction(deopt); in HoistGuard()
[all …]
|
| D | pretty_printer.h | 73 void VisitBasicBlock(HBasicBlock* block) override { in VisitBasicBlock() argument
75 PrintInt(block->GetBlockId()); in VisitBasicBlock()
76 const ArenaVector<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
85 const ArenaVector<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
95 HGraphVisitor::VisitBasicBlock(block); in VisitBasicBlock()
127 void VisitBasicBlock(HBasicBlock* block) override { in VisitBasicBlock() argument
128 current_block_ = block; in VisitBasicBlock()
129 HPrettyPrinter::VisitBasicBlock(block); in VisitBasicBlock()
|
| D | nodes.cc | 49 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock() argument
50 block->SetBlockId(blocks_.size()); in AddBlock()
51 blocks_.push_back(block); in AddBlock()
147 HBasicBlock* block = blocks_[i]; in RemoveInstructionsAsUsersFromDeadBlocks() local
148 if (block == nullptr) continue; in RemoveInstructionsAsUsersFromDeadBlocks()
149 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in RemoveInstructionsAsUsersFromDeadBlocks()
152 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in RemoveInstructionsAsUsersFromDeadBlocks()
162 HBasicBlock* block = blocks_[i]; in RemoveDeadBlocks() local
163 if (block == nullptr) continue; in RemoveDeadBlocks()
165 for (HBasicBlock* successor : block->GetSuccessors()) { in RemoveDeadBlocks()
[all …]
|
| D | graph_checker.cc | 51 static bool IsExitTryBoundaryIntoExitBlock(HBasicBlock* block) { in IsExitTryBoundaryIntoExitBlock() argument
52 if (!block->IsSingleTryBoundary()) { in IsExitTryBoundaryIntoExitBlock()
56 HTryBoundary* boundary = block->GetLastInstruction()->AsTryBoundary(); in IsExitTryBoundaryIntoExitBlock()
57 return block->GetPredecessors().size() == 1u && in IsExitTryBoundaryIntoExitBlock()
86 void GraphChecker::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock() argument
87 current_block_ = block; in VisitBasicBlock()
96 sorted_predecessors.assign(block->GetPredecessors().begin(), block->GetPredecessors().end()); in VisitBasicBlock()
105 std::count(p->GetSuccessors().begin(), p->GetSuccessors().end(), block); in VisitBasicBlock()
110 block->GetBlockId(), p_count_in_block_predecessors, p->GetBlockId(), in VisitBasicBlock()
111 p->GetBlockId(), block_count_in_p_successors, block->GetBlockId())); in VisitBasicBlock()
[all …]
|
| D | find_loops_test.cc | 39 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
40 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
50 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
51 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
64 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
65 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
79 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
80 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
92 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
93 ASSERT_EQ(block->GetLoopInformation(), nullptr); in TEST_F()
[all …]
|
| D | constant_folding_test.cc | 740 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
741 graph_->AddBlock(block); in TEST_F()
745 entry_block->AddSuccessor(block); in TEST_F()
746 block->AddSuccessor(exit_block); in TEST_F()
757 block->AddInstruction(last = new (GetAllocator()) HAbove(zero, parameter)); in TEST_F()
758 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
759 block->AddInstruction(last = new (GetAllocator()) HAbove(parameter, zero)); in TEST_F()
760 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
761 block->AddInstruction(last = new (GetAllocator()) HAboveOrEqual(zero, parameter)); in TEST_F()
762 block->AddInstruction(new (GetAllocator()) HSelect(last, parameter, parameter, 0)); in TEST_F()
[all …]
|
| D | code_sinking.cc | 144 static void AddInputs(HBasicBlock* block, in AddInputs() argument
148 for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { in AddInputs()
151 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in AddInputs()
187 HBasicBlock* block = user->GetBlock(); in FindIdealPosition() local
191 block = user->AsPhi()->IsCatchPhi() in FindIdealPosition()
192 ? block->GetDominator() in FindIdealPosition()
193 : block->GetPredecessors()[use.GetIndex()]; in FindIdealPosition()
195 finder.Update(block); in FindIdealPosition()
277 for (HBasicBlock* block : graph_->GetPostOrder()) { in SinkCodeToUncommonBranch()
278 if (block == end_block) { in SinkCodeToUncommonBranch()
[all …]
|
| D | loop_analysis.cc | 32 HBasicBlock* block = block_it.Current(); in CalculateLoopBasicProperties() local
35 for (HBasicBlock* successor : block->GetSuccessors()) { in CalculateLoopBasicProperties()
44 HIf* hif = block->GetLastInstruction()->AsIf(); in CalculateLoopBasicProperties()
51 for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { in CalculateLoopBasicProperties()
153 uint32_t GetSIMDUnrollingFactor(HBasicBlock* block, in GetSIMDUnrollingFactor() argument
164 uint32_t instruction_count = block->GetInstructions().CountSize(); in GetSIMDUnrollingFactor()
309 uint32_t GetSIMDUnrollingFactor(HBasicBlock* block, in GetSIMDUnrollingFactor() argument
314 HLoopInformation* loop_info = block->GetLoopInformation(); in GetSIMDUnrollingFactor()
354 HBasicBlock* block = it.Current(); in GetUnrollingFactor() local
355 DCHECK(block); in GetUnrollingFactor()
[all …]
|
| D | induction_var_range.cc | 144 static HInstruction* Insert(HBasicBlock* block, HInstruction* instruction) { in Insert() argument
145 DCHECK(block != nullptr); in Insert()
146 DCHECK(block->GetLastInstruction() != nullptr) << block->GetBlockId(); in Insert()
148 block->InsertInstructionBefore(instruction, block->GetLastInstruction()); in Insert()
233 HBasicBlock* block, in GenerateRange() argument
243 block, in GenerateRange()
256 HBasicBlock* block) { in GenerateTakenTest() argument
265 block, in GenerateTakenTest()
298 HBasicBlock* block) { in GenerateLastValue() argument
307 block, in GenerateLastValue()
[all …]
|
| D | induction_var_range.h | 103 HBasicBlock* block,
113 HInstruction* GenerateTakenTest(HInstruction* context, HGraph* graph, HBasicBlock* block);
127 HInstruction* GenerateLastValue(HInstruction* instruction, HGraph* graph, HBasicBlock* block);
190 HInstruction* GenerateTripCount(HLoopInformation* loop, HGraph* graph, HBasicBlock* block);
293 HBasicBlock* block,
304 HBasicBlock* block,
310 HBasicBlock* block,
316 HBasicBlock* block,
322 HBasicBlock* block,
329 HBasicBlock* block,
|
| /art/test/435-try-finally-without-catch/ |
| D | info.txt | 2 instructions with a `finally' clause but without any `catch' block,
6 block and whose result is assigned to a local value, it is smart
11 still emit a block with the exception catching and rethrowing
14 This used to be a problem for a `try' block followed by a `finally'
15 clause but with no `catch' block: in that case, the generated Dex code
16 item would list zero catch block for this method (see
20 special block(s) related to `catch'-less `try' statement(s), the
21 optimizing compiler considered this (these) as dead block(s) and
|
| /art/libdexfile/dex/ |
| D | compact_offset_table.cc | 42 const uint8_t* block = data_begin_ + offset; in GetOffset() local
43 uint16_t bit_mask = *block; in GetOffset()
44 ++block; in GetOffset()
45 bit_mask = (bit_mask << kBitsPerByte) | *block; in GetOffset()
46 ++block; in GetOffset()
57 current_offset += DecodeUnsignedLeb128(&block); in GetOffset()
|
| /art/libartbase/base/ |
| D | scoped_flock.cc | 36 /* static */ ScopedFlock LockedFile::Open(const char* filename, int flags, bool block, in Open() argument
42 UNUSED(block); in Open()
58 int operation = block ? LOCK_EX : (LOCK_EX | LOCK_NB); in Open()
79 if (block) { in Open()
90 if (block) { in Open()
|
| /art/test/504-regression-baseline-entry/ |
| D | info.txt | 1 Regression test for the baseline compiler which required the entry block to fall
2 through to the next block.
|