| /art/compiler/optimizing/ |
| D | graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) { in createIfBlock()
29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph); in createIfBlock()
40 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) { in createGotoBlock()
41 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createGotoBlock()
48 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) { in createReturnBlock()
49 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createReturnBlock()
56 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator) { in createExitBlock()
57 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createExitBlock()
72 HBasicBlock* entry_block = createGotoBlock(graph, &allocator); in TEST()
73 HBasicBlock* if_block = createIfBlock(graph, &allocator); in TEST()
[all …]
|
| D | nodes.cc | 23 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock()
36 HBasicBlock* block = blocks_.Get(i); in RemoveDeadBlocks()
50 void HGraph::VisitBlockForBackEdges(HBasicBlock* block, in VisitBlockForBackEdges()
59 HBasicBlock* successor = block->GetSuccessors().Get(i); in VisitBlockForBackEdges()
95 HBasicBlock* HGraph::FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const { in FindCommonDominator()
113 void HGraph::VisitBlockForDominatorTree(HBasicBlock* block, in VisitBlockForDominatorTree()
114 HBasicBlock* predecessor, in VisitBlockForDominatorTree()
140 void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) { in SplitCriticalEdge()
143 HBasicBlock* new_block = new (arena_) HBasicBlock(this); in SplitCriticalEdge()
158 void HGraph::SimplifyLoop(HBasicBlock* header) { in SimplifyLoop()
[all …]
|
| D | nodes.h | 29 class HBasicBlock; variable
63 friend class HBasicBlock; variable
84 const GrowableArray<HBasicBlock*>& GetBlocks() const { return blocks_; } in GetBlocks()
86 HBasicBlock* GetEntryBlock() const { return entry_block_; } in GetEntryBlock()
87 HBasicBlock* GetExitBlock() const { return exit_block_; } in GetExitBlock()
89 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; } in SetEntryBlock()
90 void SetExitBlock(HBasicBlock* block) { exit_block_ = block; } in SetExitBlock()
92 void AddBlock(HBasicBlock* block);
103 void SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor);
104 void SimplifyLoop(HBasicBlock* header);
[all …]
|
| D | ssa_liveness_analysis.cc | 50 static void VisitBlockForLinearization(HBasicBlock* block, in VisitBlockForLinearization()
51 GrowableArray<HBasicBlock*>* order, in VisitBlockForLinearization()
64 HBasicBlock* first_successor = block->GetSuccessors().Get(0); in VisitBlockForLinearization()
65 HBasicBlock* second_successor = block->GetSuccessors().Get(1); in VisitBlockForLinearization()
105 HBasicBlock* block = it.Current(); in NumberInstructions()
147 HBasicBlock* block = it.Current(); in ComputeLiveness()
168 HBasicBlock* block = it.Current(); in ComputeLiveRanges()
176 HBasicBlock* successor = block->GetSuccessors().Get(i); in ComputeLiveRanges()
243 HBasicBlock* back_edge = block->GetLoopInformation()->GetBackEdges().Get(0); in ComputeLiveRanges()
261 const HBasicBlock& block = *it.Current(); in ComputeLiveInAndLiveOutSets()
[all …]
|
| D | ssa_builder.h | 38 GrowableArray<HInstruction*>* GetLocalsFor(HBasicBlock* block) { in GetLocalsFor()
48 HInstruction* ValueOfLocal(HBasicBlock* block, size_t local);
50 void VisitBasicBlock(HBasicBlock* block);
61 GrowableArray<HBasicBlock*> loop_headers_;
|
| D | builder.h | 63 HBasicBlock* FindBlockStartingAt(int32_t index) const;
115 GrowableArray<HBasicBlock*> branch_targets_;
119 HBasicBlock* entry_block_;
120 HBasicBlock* exit_block_;
121 HBasicBlock* current_block_;
|
| D | register_allocator.h | 27 class HBasicBlock; variable
107 void ConnectSplitSiblings(LiveInterval* interval, HBasicBlock* from, HBasicBlock* to) const;
110 void InsertParallelMoveAtExitOf(HBasicBlock* block, Location source, Location destination) const;
111 void InsertParallelMoveAtEntryOf(HBasicBlock* block, Location source, Location destination) const;
|
| D | pretty_printer.h | 71 virtual void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
74 const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors(); in VisitBasicBlock()
83 const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors(); in VisitBasicBlock()
125 virtual void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
140 HBasicBlock* current_block_;
|
| D | ssa_liveness_analysis.h | 28 BlockInfo(ArenaAllocator* allocator, const HBasicBlock& block, size_t number_of_ssa_values) in BlockInfo()
39 const HBasicBlock& block_;
183 void AddPhiUse(HInstruction* instruction, size_t input_index, HBasicBlock* block) { in AddPhiUse()
482 BitVector* GetLiveInSet(const HBasicBlock& block) const { in GetLiveInSet()
486 BitVector* GetLiveOutSet(const HBasicBlock& block) const { in GetLiveOutSet()
490 BitVector* GetKillSet(const HBasicBlock& block) const { in GetKillSet()
494 const GrowableArray<HBasicBlock*>& GetLinearPostOrder() const { in GetLinearPostOrder()
538 bool UpdateLiveIn(const HBasicBlock& block);
541 bool UpdateLiveOut(const HBasicBlock& block);
545 GrowableArray<HBasicBlock*> linear_post_order_;
[all …]
|
| D | ssa_phi_elimination.cc | 24 HBasicBlock* block = it.Current(); in Run()
59 HBasicBlock* block = it.Current(); in Run()
75 HBasicBlock* block = it.Current(); in Run()
|
| D | graph_visualizer.cc | 84 void PrintPredecessors(HBasicBlock* block) { in PrintPredecessors()
88 HBasicBlock* predecessor = block->GetPredecessors().Get(i); in PrintPredecessors()
94 void PrintSuccessors(HBasicBlock* block) { in PrintSuccessors()
98 HBasicBlock* successor = block->GetSuccessors().Get(i); in PrintSuccessors()
191 void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | code_generator.cc | 34 const GrowableArray<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in CompileBaseline()
50 HBasicBlock* block = blocks.Get(i); in CompileBaseline()
72 const GrowableArray<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in CompileOptimized()
79 HBasicBlock* block = blocks.Get(i); in CompileOptimized()
245 bool CodeGenerator::GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const { in GoesToNextBlock()
250 Label* CodeGenerator::GetLabelOf(HBasicBlock* block) const { in GetLabelOf()
|
| D | ssa_builder.cc | 34 HBasicBlock* block = loop_headers_.Get(i); in BuildSsa()
60 HInstruction* SsaBuilder::ValueOfLocal(HBasicBlock* block, size_t local) { in ValueOfLocal()
64 void SsaBuilder::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | code_generator.h | 81 Label* GetLabelOf(HBasicBlock* block) const;
82 bool GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const;
|
| D | builder.cc | 147 HBasicBlock* target = FindBlockStartingAt(dex_offset + instruction.GetTargetOffset()); in If_22t()
163 HBasicBlock* target = FindBlockStartingAt(dex_offset + instruction.GetTargetOffset()); in If_21t()
182 entry_block_ = new (arena_) HBasicBlock(graph_); in BuildGraph()
184 exit_block_ = new (arena_) HBasicBlock(graph_); in BuildGraph()
217 HBasicBlock* block = FindBlockStartingAt(index); in MaybeUpdateCurrentBlock()
238 HBasicBlock* block = new (arena_) HBasicBlock(graph_); in ComputeBranchTargets()
251 block = new (arena_) HBasicBlock(graph_); in ComputeBranchTargets()
257 block = new (arena_) HBasicBlock(graph_); in ComputeBranchTargets()
267 HBasicBlock* HGraphBuilder::FindBlockStartingAt(int32_t index) const { in FindBlockStartingAt()
581 HBasicBlock* target = FindBlockStartingAt(instruction.GetTargetOffset() + dex_offset); in AnalyzeDexInstruction()
|
| D | ssa_type_propagation.h | 33 void VisitBasicBlock(HBasicBlock* block);
|
| D | live_ranges_test.cc | 70 HBasicBlock* block = graph->GetBlocks().Get(1); in TEST()
116 HBasicBlock* block = graph->GetBlocks().Get(3); in TEST()
|
| D | register_allocator.cc | 740 void RegisterAllocator::InsertParallelMoveAtExitOf(HBasicBlock* block, in InsertParallelMoveAtExitOf()
762 void RegisterAllocator::InsertParallelMoveAtEntryOf(HBasicBlock* block, in InsertParallelMoveAtEntryOf()
849 HBasicBlock* from, in ConnectSplitSiblings()
850 HBasicBlock* to) const { in ConnectSplitSiblings()
953 HBasicBlock* block = it.Current(); in Resolve()
966 HBasicBlock* current = it.Current(); in Resolve()
970 HBasicBlock* predecessor = current->GetPredecessors().Get(i); in Resolve()
|
| D | ssa_type_propagation.cc | 56 void SsaTypePropagation::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | register_allocator_test.cc | 307 HBasicBlock* loop_header = graph->GetBlocks().Get(2); in TEST()
316 HBasicBlock* return_block = graph->GetBlocks().Get(3); in TEST()
|
| D | liveness_test.cc | 58 HBasicBlock* block = it.Current(); in TestCode()
|
| D | ssa_test.cc | 68 HBasicBlock* block = graph->GetBlocks().Get(i); in ReNumberInstructions()
|
| D | find_loops_test.cc | 116 HBasicBlock* block = graph->GetBlocks().Get(block_id); in TestBlock()
|
| D | code_generator_x86_64.cc | 367 HBasicBlock* successor = got->GetSuccessor(); in VisitGoto()
|
| D | code_generator_arm.cc | 528 HBasicBlock* successor = got->GetSuccessor(); in VisitGoto()
|