Home
last modified time | relevance | path

Searched refs:BasicBlockId (Results 1 – 16 of 16) sorted by relevance

/art/compiler/dex/
Dmir_graph_test.cc30 BasicBlockId successors[kMaxPredecessors];
32 BasicBlockId predecessors[kMaxPredecessors];
89 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>( in DoPrepareBasicBlocks()
125 BasicBlockId id = cu_.mir_graph->topological_order_->Get(i); in ComputeTopologicalSortOrder()
130 void DoCheckOrder(const BasicBlockId* ids, size_t count) { in DoCheckOrder()
138 void CheckOrder(const BasicBlockId (&ids)[count]) { in CheckOrder()
173 const BasicBlockId expected_order[] = { in TEST_F()
195 const BasicBlockId expected_order[] = { in TEST_F()
218 const BasicBlockId expected_order[] = { in TEST_F()
242 const BasicBlockId expected_order[] = { in TEST_F()
[all …]
Dmir_graph.h200 typedef uint16_t BasicBlockId; typedef
201 static const BasicBlockId NullBasicBlockId = 0;
351 BasicBlockId bb;
356 BasicBlockId* phi_incoming;
392 BasicBlockId id;
393 BasicBlockId dfs_id;
395 BasicBlockId fall_through;
396 BasicBlockId taken;
397 BasicBlockId i_dom; // Immediate dominator.
415 GrowableArray<BasicBlockId>* predecessors;
[all …]
Ddataflow_iterator-inl.h31 BasicBlockId bb_id = block_id_list_->Get(idx_); in ForwardSingleNext()
54 BasicBlockId bb_id = block_id_list_->Get(idx_); in ForwardRepeatNext()
69 BasicBlockId bb_id = block_id_list_->Get(idx_); in ReverseSingleNext()
92 BasicBlockId bb_id = block_id_list_->Get(idx_); in ReverseRepeatNext()
161 BasicBlockId idx = idx_; in Next()
Dlocal_value_numbering.h39 LocalValueNumbering(GlobalValueNumbering* gvn, BasicBlockId id, ScopedArenaAllocator* allocator);
41 BasicBlockId Id() const { in Id()
358 COMPILE_ASSERT(sizeof(BasicBlockId) == sizeof(uint16_t), BasicBlockId_must_be_16_bit);
359 BasicBlockId id_;
387 ScopedArenaVector<BasicBlockId> merge_names_;
389 ScopedArenaSafeMap<ScopedArenaVector<BasicBlockId>, uint16_t> merge_map_;
Dssa_transformation.cc97 dfs_order_ = new (arena_) GrowableArray<BasicBlockId>(arena_, GetNumBlocks(), in ComputeDFSOrders()
106 dfs_post_order_ = new (arena_) GrowableArray<BasicBlockId>(arena_, GetNumBlocks(), in ComputeDFSOrders()
185 new (arena_) GrowableArray<BasicBlockId>(arena_, num_reachable_blocks_, in ComputeDomPostOrderTraversal()
320 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in ComputeblockIDom()
557 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in InsertPhiNodeOperands()
561 BasicBlockId* incoming = in InsertPhiNodeOperands()
562 static_cast<BasicBlockId*>(arena_->Alloc(sizeof(BasicBlockId) * num_uses, in InsertPhiNodeOperands()
Dmir_graph.cc1254 BasicBlockId* incoming = mir->meta.phi_incoming; in GetDalvikDisassembly()
1491 bb->predecessors = new (arena_) GrowableArray<BasicBlockId>(arena_, in NewMemBB()
1542 ScopedArenaVector<BasicBlockId>* tmp_stack) { in SelectTopologicalSortOrderFallBack()
1564 BasicBlockId current_id = tmp_stack->back(); in SelectTopologicalSortOrderFallBack()
1593 static void ComputeUnvisitedReachableFrom(MIRGraph* mir_graph, BasicBlockId bb_id, in ComputeUnvisitedReachableFrom()
1595 ScopedArenaVector<BasicBlockId>* tmp_stack) { in ComputeUnvisitedReachableFrom()
1601 BasicBlockId current_id = tmp_stack->back(); in ComputeUnvisitedReachableFrom()
1605 GrowableArray<BasicBlockId>::Iterator iter(current_bb->predecessors); in ComputeUnvisitedReachableFrom()
1622 ScopedArenaVector<BasicBlockId> loop_head_stack(allocator.Adapter()); in ComputeTopologicalSortOrder()
1645 topological_order_ = new (arena_) GrowableArray<BasicBlockId>(arena_, num_blocks); in ComputeTopologicalSortOrder()
[all …]
Ddataflow_iterator.h107 …GrowableArray<BasicBlockId>* block_id_list_; /**< @brief the list of BasicBlocks we want to i…
434 const GrowableArray<BasicBlockId>* const loop_ends_;
Dmir_optimization_test.cc41 BasicBlockId successors[kMaxPredecessors];
43 BasicBlockId predecessors[kMaxPredecessors];
48 BasicBlockId bbid;
132 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>( in DoPrepareBasicBlocks()
Dglobal_value_numbering.cc97 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in PrepareBasicBlock()
183 BasicBlockId succ_id) { in HasNullCheckLastInsn()
Dglobal_value_numbering.h191 static bool HasNullCheckLastInsn(const BasicBlock* pred_bb, BasicBlockId succ_id);
Dmir_optimization.cc541 BasicBlockId* incoming = phi->meta.phi_incoming; in BasicBlockOpt()
650 BasicBlockId t_bb = prev->taken; in LayoutBlocks()
797 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in EliminateNullChecksAndInferTypes()
1079 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in EliminateClassInitChecks()
Dglobal_value_numbering_test.cc48 BasicBlockId successors[kMaxPredecessors];
50 BasicBlockId predecessors[kMaxPredecessors];
57 BasicBlockId bbid;
206 bb->predecessors = new (&cu_.arena) GrowableArray<BasicBlockId>( in DoPrepareBasicBlocks()
251 mir->meta.phi_incoming = static_cast<BasicBlockId*>( in DoPrepareMIRs()
252 allocator_->Alloc(def->num_uses * sizeof(BasicBlockId), kArenaAllocDFInfo)); in DoPrepareMIRs()
Dmir_dataflow.cc1355 GrowableArray<BasicBlockId>::Iterator iter(bb->predecessors); in VerifyPredInfo()
1370 BasicBlockId succ_bb = successor_block_info->block; in VerifyPredInfo()
Dlocal_value_numbering.cc337 merge_map_(std::less<ScopedArenaVector<BasicBlockId>>(), allocator->Adapter()), in LocalValueNumbering()
1042 BasicBlockId* incoming = mir->meta.phi_incoming; in HandlePhi()
/art/compiler/dex/quick/
Dmir_to_lir.cc634 BasicBlockId target_id = is_taken ? bb->taken : bb->fall_through; in CompileDalvikInstruction()
662 BasicBlockId target_id = is_taken ? bb->taken : bb->fall_through; in CompileDalvikInstruction()
/art/compiler/dex/portable/
Dmir_to_gbc.cc1572 BasicBlockId* incoming = mir->meta.phi_incoming; in HandlePhiNodes()