| /art/compiler/dex/ |
| D | mir_graph.h | 174 typedef uint16_t BasicBlockId; typedef
175 static const BasicBlockId NullBasicBlockId = 0;
335 BasicBlockId bb;
340 BasicBlockId* phi_incoming;
373 BasicBlock(BasicBlockId block_id, BBType type, ArenaAllocator* allocator) in BasicBlock()
384 BasicBlockId id;
385 BasicBlockId dfs_id;
387 BasicBlockId fall_through;
388 BasicBlockId taken;
389 BasicBlockId i_dom; // Immediate dominator.
[all …]
|
| D | dataflow_iterator-inl.h | 31 BasicBlockId bb_id = (*block_id_list_)[idx_]; in ForwardSingleNext()
54 BasicBlockId bb_id = (*block_id_list_)[idx_]; in ForwardRepeatNext()
69 BasicBlockId bb_id = (*block_id_list_)[idx_]; in ReverseSingleNext()
92 BasicBlockId bb_id = (*block_id_list_)[idx_]; in ReverseRepeatNext()
132 BasicBlockId idx = idx_; in Next()
180 BasicBlockId idx = idx_; in Next()
|
| D | mir_graph_test.cc | 32 BasicBlockId successors[kMaxPredecessors];
34 BasicBlockId predecessors[kMaxPredecessors];
122 BasicBlockId id = cu_.mir_graph->topological_order_[i]; in ComputeTopologicalSortOrder()
127 void DoCheckOrder(const BasicBlockId* ids, size_t count) { in DoCheckOrder()
135 void CheckOrder(const BasicBlockId (&ids)[count]) { in CheckOrder()
170 const BasicBlockId expected_order[] = { in TEST_F()
192 const BasicBlockId expected_order[] = { in TEST_F()
215 const BasicBlockId expected_order[] = { in TEST_F()
239 const BasicBlockId expected_order[] = { in TEST_F()
262 const BasicBlockId expected_order[] = { in TEST_F()
[all …]
|
| D | global_value_numbering.h | 85 const LocalValueNumbering* GetLvn(BasicBlockId bb_id) const;
197 static bool HasNullCheckLastInsn(const BasicBlock* pred_bb, BasicBlockId succ_id) { in HasNullCheckLastInsn()
205 bool IsBlockEnteredOnTrue(uint16_t cond, BasicBlockId bb_id);
206 bool IsTrueInBlock(uint16_t cond, BasicBlockId bb_id);
255 inline const LocalValueNumbering* GlobalValueNumbering::GetLvn(BasicBlockId bb_id) const { in GetLvn()
|
| D | global_value_numbering.cc | 97 for (BasicBlockId pred_id : bb->predecessors) { in PrepareBasicBlock()
204 bool GlobalValueNumbering::IsBlockEnteredOnTrue(uint16_t cond, BasicBlockId bb_id) { in IsBlockEnteredOnTrue()
208 BasicBlockId pred_id = bb->predecessors[0]; in IsBlockEnteredOnTrue()
221 bool GlobalValueNumbering::IsTrueInBlock(uint16_t cond, BasicBlockId bb_id) { in IsTrueInBlock()
|
| D | dataflow_iterator.h | 107 …const ArenaVector<BasicBlockId>* block_id_list_; /**< @brief the list of BasicBlocks we want to i…
352 const ArenaVector<BasicBlockId>* const loop_ends_;
399 const ArenaVector<BasicBlockId>* const loop_ends_;
|
| D | mir_graph.cc | 336 BasicBlockId mapped_id = (*dex_pc_to_block_map)[p->offset]; in FindBlock()
891 BasicBlockId out_bb_id = dex_pc_to_block_map[current_code_item_->insns_size_in_code_units_]; in InlineMethod()
1315 BasicBlockId* incoming = mir->meta.phi_incoming; in DisassembleExtendedInstr()
1861 ScopedArenaVector<BasicBlockId>* tmp_stack) { in SelectTopologicalSortOrderFallBack()
1883 BasicBlockId current_id = tmp_stack->back(); in SelectTopologicalSortOrderFallBack()
1912 static void ComputeUnvisitedReachableFrom(MIRGraph* mir_graph, BasicBlockId bb_id, in ComputeUnvisitedReachableFrom()
1914 ScopedArenaVector<BasicBlockId>* tmp_stack) { in ComputeUnvisitedReachableFrom()
1920 BasicBlockId current_id = tmp_stack->back(); in ComputeUnvisitedReachableFrom()
1924 for (BasicBlockId pred_id : current_bb->predecessors) { in ComputeUnvisitedReachableFrom()
1941 ScopedArenaVector<BasicBlockId> loop_head_stack(allocator.Adapter()); in ComputeTopologicalSortOrder()
[all …]
|
| D | local_value_numbering.h | 39 LocalValueNumbering(GlobalValueNumbering* gvn, BasicBlockId id, ScopedArenaAllocator* allocator);
41 BasicBlockId Id() const { in Id()
375 static_assert(sizeof(BasicBlockId) == sizeof(uint16_t), "BasicBlockId must be 16 bit");
376 BasicBlockId id_;
|
| D | mir_optimization_test.cc | 36 BasicBlockId successors[kMaxPredecessors];
38 BasicBlockId predecessors[kMaxPredecessors];
53 BasicBlockId bbid;
454 bool IsBackEdge(BasicBlockId branch_bb, BasicBlockId target_bb) { in IsBackEdge()
459 bool IsSuspendCheckEdge(BasicBlockId branch_bb, BasicBlockId target_bb) { in IsSuspendCheckEdge()
|
| D | ssa_transformation.cc | 519 BasicBlockId* incoming = arena_->AllocArray<BasicBlockId>(num_uses, kArenaAllocDFInfo); in InsertPhiNodeOperands()
522 for (BasicBlockId pred_id : bb->predecessors) { in InsertPhiNodeOperands()
|
| D | type_inference_test.cc | 55 BasicBlockId successors[kMaxPredecessors];
57 BasicBlockId predecessors[kMaxPredecessors];
64 BasicBlockId bbid;
416 allocator_->AllocArray<BasicBlockId>(def->num_uses, kArenaAllocDFInfo); in DoPrepareMIRs()
460 void MapVRegToSReg(int vreg, int32_t sreg, const BasicBlockId (&bb_ids)[count]) { in MapVRegToSReg()
462 for (BasicBlockId bb_id : bb_ids) { in MapVRegToSReg()
1310 static const BasicBlockId v0_def_blocks[] = { 3u, 4u, 5u, 6u }; in TEST_F()
1346 static const BasicBlockId v0_def_blocks[] = { 3u, 4u, 5u, 6u }; in TEST_F()
1383 static const BasicBlockId v0_def_blocks[] = { 3u, 4u, 5u, 6u }; in TEST_F()
1420 static const BasicBlockId v0_def_blocks[] = { 3u, 4u, 5u, 6u }; in TEST_F()
[all …]
|
| D | type_inference.cc | 233 BasicBlockId bb_id = bb->id; in AddPseudoPhis()
292 for (BasicBlockId pred_id : bb->predecessors) { in ProcessPseudoPhis()
307 for (BasicBlockId pred_id : bb->predecessors) { in ProcessPseudoPhis()
360 BasicBlockId best_id = NullBasicBlockId; in FindTopologicallyEarliestPredecessor()
361 for (BasicBlockId pred_id : bb->predecessors) { in FindTopologicallyEarliestPredecessor()
381 for (BasicBlockId pred_id : bb->predecessors) { in IsSRegLiveAtStart()
|
| D | mir_dataflow.cc | 1194 BasicBlockId bb_id = bb->id; in DoSSAConversion()
1416 for (BasicBlockId pred_id : bb->predecessors) { in VerifyPredInfo()
1426 BasicBlockId succ_bb = successor_block_info->block; in VerifyPredInfo()
|
| D | mir_optimization.cc | 516 BasicBlockId edge_to_kill = is_taken ? bb->fall_through : bb->taken; in BasicBlockOpt()
807 BasicBlockId t_bb = prev->taken; in LayoutBlocks()
974 for (BasicBlockId pred_id : bb->predecessors) { in EliminateNullChecks()
1268 for (BasicBlockId pred_id : bb->predecessors) { in EliminateClassInitChecks()
1764 for (BasicBlockId pred_id : bb->predecessors) { in EliminateSuspendChecks()
|
| D | global_value_numbering_test.cc | 52 BasicBlockId successors[kMaxPredecessors];
54 BasicBlockId predecessors[kMaxPredecessors];
61 BasicBlockId bbid;
255 allocator_->AllocArray<BasicBlockId>(def->num_uses, kArenaAllocDFInfo); in DoPrepareMIRs()
279 void DoPrepareVregToSsaMapExit(BasicBlockId bb_id, const int32_t* map, size_t count) { in DoPrepareVregToSsaMapExit()
289 void PrepareVregToSsaMapExit(BasicBlockId bb_id, const int32_t (&map)[count]) { in PrepareVregToSsaMapExit()
|
| D | gvn_dead_code_elimination.cc | 538 for (BasicBlockId pred_id : bb_->predecessors) { in CreatePhi()
546 phi->meta.phi_incoming = static_cast<BasicBlockId*>(mir_graph_->GetArena()->Alloc( in CreatePhi()
547 sizeof(BasicBlockId) * num_uses, kArenaAllocDFInfo)); in CreatePhi()
|
| D | gvn_dead_code_elimination_test.cc | 52 BasicBlockId successors[kMaxPredecessors];
54 BasicBlockId predecessors[kMaxPredecessors];
61 BasicBlockId bbid;
283 allocator_->AllocArray<BasicBlockId>(def->num_uses, kArenaAllocDFInfo); in DoPrepareMIRs()
|
| D | local_value_numbering.cc | 344 merge_map_(std::less<ScopedArenaVector<BasicBlockId>>(), allocator->Adapter()), in LocalValueNumbering()
1168 BasicBlockId* incoming = mir->meta.phi_incoming; in HandlePhi()
2017 for (BasicBlockId pred_id : bb->predecessors) { in GetStartingVregValueNumberImpl()
|
| /art/compiler/dex/quick/ |
| D | mir_to_lir.cc | 1303 for (BasicBlockId dfs_id : mir_graph_->GetDfsOrder()) { in SpecialMIR2LIR()
|