| /art/compiler/optimizing/ |
| D | nodes.cc | 23 void HGraph::AddBlock(HBasicBlock* block) { in AddBlock()
36 HBasicBlock* block = blocks_.Get(i); in RemoveDeadBlocks() local
50 void HGraph::VisitBlockForBackEdges(HBasicBlock* block, in VisitBlockForBackEdges()
113 void HGraph::VisitBlockForDominatorTree(HBasicBlock* block, in VisitBlockForDominatorTree()
140 void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) { in SplitCriticalEdge()
204 HBasicBlock* block = blocks_.Get(i); in SimplifyCFG() local
222 HBasicBlock* block = blocks_.Get(i); in FindNaturalLoops() local
234 void HLoopInformation::PopulateRecursive(HBasicBlock* block) { in PopulateRecursive()
311 HBasicBlock* block, in Add()
329 HBasicBlock* block, in Remove()
[all …]
|
| D | ssa_liveness_analysis.cc | 50 static void VisitBlockForLinearization(HBasicBlock* block, in VisitBlockForLinearization()
105 HBasicBlock* block = it.Current(); in NumberInstructions() local
147 HBasicBlock* block = it.Current(); in ComputeLiveness() local
168 HBasicBlock* block = it.Current(); in ComputeLiveRanges() local
261 const HBasicBlock& block = *it.Current(); in ComputeLiveInAndLiveOutSets() local
273 bool SsaLivenessAnalysis::UpdateLiveOut(const HBasicBlock& block) { in UpdateLiveOut()
287 bool SsaLivenessAnalysis::UpdateLiveIn(const HBasicBlock& block) { in UpdateLiveIn()
|
| D | ssa_phi_elimination.cc | 24 HBasicBlock* block = it.Current(); in Run() local
59 HBasicBlock* block = it.Current(); in Run() local
75 HBasicBlock* block = it.Current(); in Run() local
|
| D | ssa_builder.cc | 34 HBasicBlock* block = loop_headers_.Get(i); in BuildSsa() local
60 HInstruction* SsaBuilder::ValueOfLocal(HBasicBlock* block, size_t local) { in ValueOfLocal()
64 void SsaBuilder::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | pretty_printer.h | 71 virtual void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
125 virtual void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | graph_test.cc | 41 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createGotoBlock() local
49 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createReturnBlock() local
57 HBasicBlock* block = new (allocator) HBasicBlock(graph); in createExitBlock() local
291 HBasicBlock* block = createGotoBlock(graph, &allocator); in TEST() local
|
| D | ssa_builder.h | 38 GrowableArray<HInstruction*>* GetLocalsFor(HBasicBlock* block) { in GetLocalsFor()
|
| D | ssa_liveness_analysis.h | 28 BlockInfo(ArenaAllocator* allocator, const HBasicBlock& block, size_t number_of_ssa_values) in BlockInfo()
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()
|
| D | graph_visualizer.cc | 84 void PrintPredecessors(HBasicBlock* block) { in PrintPredecessors()
94 void PrintSuccessors(HBasicBlock* block) { in PrintSuccessors()
191 void VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | live_ranges_test.cc | 70 HBasicBlock* block = graph->GetBlocks().Get(1); in TEST() local
116 HBasicBlock* block = graph->GetBlocks().Get(3); in TEST() local
|
| D | ssa_type_propagation.cc | 56 void SsaTypePropagation::VisitBasicBlock(HBasicBlock* block) { in VisitBasicBlock()
|
| D | code_generator.cc | 50 HBasicBlock* block = blocks.Get(i); in CompileBaseline() local
79 HBasicBlock* block = blocks.Get(i); in CompileOptimized() local
|
| D | nodes.h | 89 void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; } in SetEntryBlock()
90 void SetExitBlock(HBasicBlock* block) { exit_block_ = block; } in SetExitBlock()
209 bool IsBackEdge(HBasicBlock* block) { in IsBackEdge()
308 void AddSuccessor(HBasicBlock* block) { in AddSuccessor()
321 void RemovePredecessor(HBasicBlock* block) { in RemovePredecessor()
329 void AddPredecessor(HBasicBlock* block) { in AddPredecessor()
501 void SetBlock(HBasicBlock* block) { block_ = block; } in SetBlock()
|
| D | register_allocator.cc | 740 void RegisterAllocator::InsertParallelMoveAtExitOf(HBasicBlock* block, in InsertParallelMoveAtExitOf()
762 void RegisterAllocator::InsertParallelMoveAtEntryOf(HBasicBlock* block, in InsertParallelMoveAtEntryOf()
953 HBasicBlock* block = it.Current(); in Resolve() local
|
| D | liveness_test.cc | 58 HBasicBlock* block = it.Current(); in TestCode() local
|
| D | builder.cc | 217 HBasicBlock* block = FindBlockStartingAt(index); in MaybeUpdateCurrentBlock() local
238 HBasicBlock* block = new (arena_) HBasicBlock(graph_); in ComputeBranchTargets() local
|
| D | ssa_test.cc | 68 HBasicBlock* block = graph->GetBlocks().Get(i); in ReNumberInstructions() local
|
| D | find_loops_test.cc | 116 HBasicBlock* block = graph->GetBlocks().Get(block_id); in TestBlock() local
|
| /art/compiler/dex/ |
| D | ssa_transformation.cc | 64 void MIRGraph::MarkPreOrder(BasicBlock* block) { in MarkPreOrder()
72 void MIRGraph::RecordDFSOrders(BasicBlock* block) { in RecordDFSOrders()
581 void MIRGraph::DoDFSPreOrderSSARename(BasicBlock* block) { in DoDFSPreOrderSSARename()
|
| D | mir_graph.h | 486 BasicBlockId block; member
|
| /art/compiler/sea_ir/code_gen/ |
| D | code_gen.h | 45 void AddBlock(int region_id, llvm::BasicBlock* block) { in AddBlock()
49 void AddBlock(Region* region, llvm::BasicBlock* block) { in AddBlock()
|