Searched refs:bb (Results 1 - 25 of 53) sorted by relevance

123

/art/compiler/dex/
H A Dpost_opt_passes.cc28 BasicBlock* bb = pass_me_data_holder->bb; local
29 DCHECK(bb != nullptr);
30 MIR* mir = bb->first_mir_insn;
38 bb->RemoveMIR(mir);
57 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) {
58 bb->predecessors.clear();
63 for (BasicBlock* bb
[all...]
H A Dbb_optimizations.cc31 BasicBlock* bb = pass_me_data_holder->bb; local
32 DCHECK(bb != nullptr);
33 c_unit->mir_graph->LayoutBlocks(bb);
46 BasicBlock* bb = pass_me_data_holder->bb; local
47 DCHECK(bb != nullptr);
48 c_unit->mir_graph->CombineBlocks(bb);
75 BasicBlock* bb = pass_me_data_holder->bb; local
[all...]
H A Dssa_transformation.cc29 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) {
30 bb->visited = false;
34 BasicBlock* MIRGraph::NeedsVisit(BasicBlock* bb) { argument
35 if (bb != nullptr) {
36 if (bb->visited || bb->hidden) {
37 bb = nullptr;
40 return bb;
43 NextUnvisitedSuccessor(BasicBlock* bb) argument
123 FillDefBlockMatrix(BasicBlock* bb) argument
171 ComputeDomPostOrderTraversal(BasicBlock* bb) argument
219 ComputeDominanceFrontier(BasicBlock* bb) argument
247 InitializeDominationInfo(BasicBlock* bb) argument
288 ComputeblockIDom(BasicBlock* bb) argument
331 ComputeBlockDominators(BasicBlock* bb) argument
341 SetDominators(BasicBlock* bb) argument
433 ComputeBlockLiveIns(BasicBlock* bb) argument
506 InsertPhiNodeOperands(BasicBlock* bb) argument
[all...]
H A Dglobal_value_numbering.cc48 LocalValueNumbering* GlobalValueNumbering::PrepareBasicBlock(BasicBlock* bb, argument
53 if (bb->block_type != kDalvikByteCode && bb->block_type != kEntryBlock) {
54 DCHECK(bb->first_mir_insn == nullptr);
71 work_lvn_.reset(new (allocator) LocalValueNumbering(this, bb->id, allocator));
72 if (bb->block_type == kEntryBlock) {
74 DCHECK(bb->first_mir_insn == nullptr); // modifications_allowed_ is irrelevant.
93 loop_head_idx != mir_graph_->GetTopologicalSortOrderIndexes()[bb->id];
97 for (BasicBlockId pred_id : bb->predecessors) {
107 if (bb
125 FinishBasicBlock(BasicBlock* bb) argument
206 BasicBlock* bb = mir_graph_->GetBasicBlock(bb_id); local
228 BasicBlock* bb = mir_graph_->GetBasicBlock(bb_id); local
[all...]
H A Ddataflow_iterator-inl.h107 BasicBlock* bb = mir_graph_->GetBlockList()[idx_++]; local
108 DCHECK(bb != nullptr);
109 if (!bb->hidden) {
110 res = bb;
134 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]); local
135 DCHECK(bb != nullptr);
139 return bb;
145 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx_ - 1]); local
146 bb->visited = true;
149 ChildBlockIterator iter(bb, mir_graph
182 BasicBlock* bb = mir_graph_->GetBasicBlock((*block_id_list_)[idx]); local
[all...]
H A Dmir_optimization.cc38 static unsigned int Predecessors(BasicBlock* bb) { argument
39 return bb->predecessors.size();
58 void MIRGraph::DoConstantPropagation(BasicBlock* bb) { argument
61 for (mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
121 BasicBlock* bb = *p_bb; local
125 bb = GetBasicBlock(bb->fall_through);
126 if ((bb == nullptr) || Predecessors(bb) != 1) {
130 *p_bb = bb;
145 FindMoveResult(BasicBlock* bb, MIR* mir) argument
164 NextDominatedBlock(BasicBlock* bb) argument
187 FindPhi(BasicBlock* bb, int ssa_name) argument
468 BasicBlockOpt(BasicBlock* bb) argument
732 CountChecks(class BasicBlock* bb) argument
756 LayoutBlocks(BasicBlock* bb) argument
818 CombineBlocks(class BasicBlock* bb) argument
947 EliminateNullChecks(BasicBlock* bb) argument
1134 InferTypes(BasicBlock* bb) argument
1250 EliminateClassInitChecks(BasicBlock* bb) argument
1378 ApplyGlobalValueNumbering(BasicBlock* bb) argument
1427 EliminateDeadCode(BasicBlock* bb) argument
1514 InlineSpecialMethods(BasicBlock* bb) argument
1593 BuildExtendedBBList(class BasicBlock* bb) argument
1739 EliminateSuspendChecks(BasicBlock* bb) argument
1935 MultiplyAddOpt(BasicBlock* bb) argument
[all...]
H A Dbb_optimizations.h130 BasicBlock* bb = pass_me_data_holder->bb; local
131 DCHECK(bb != nullptr);
132 c_unit->mir_graph->InlineSpecialMethods(bb);
187 BasicBlock* bb = pass_me_data_holder->bb; local
188 DCHECK(bb != nullptr);
189 return c_unit->mir_graph->EliminateNullChecks(bb);
218 BasicBlock* bb = pass_me_data_holder->bb; local
253 BasicBlock* bb = pass_me_data_holder->bb; local
287 BasicBlock* bb = pass_me_data_holder->bb; local
359 BasicBlock* bb = down_cast<PassMEDataHolder*>(data)->bb; local
444 BasicBlock* bb = pass_me_data_holder->bb; local
[all...]
H A Dmir_graph.cc245 BasicBlock* bb = GetBasicBlock(successor_block_info->block); local
246 if (bb != nullptr) {
247 bb->ErasePredecessor(orig_block->id);
248 bb->predecessors.push_back(bottom_block->id);
273 p->bb = bottom_block->id;
277 p->bb = bottom_block->id;
303 BasicBlock* bb = GetBasicBlock(block_id); local
305 if ((bb != nullptr) && (bb->start_offset == code_offset)) {
307 return bb;
987 BasicBlock* bb = GetBasicBlock(block_idx); local
1673 GetBlockName(BasicBlock* bb, char* name) argument
1739 NewMemCallInfo(BasicBlock* bb, MIR* mir, InvokeType type, bool is_range) argument
1779 BasicBlock* bb = new (arena_) BasicBlock(block_id, block_type, arena_); local
1981 BasicBlock* bb = nullptr; local
2104 ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph) argument
[all...]
H A Dtype_inference.cc185 lb->second.ending_mod_s_reg[check_cast->bb] = extra_s_reg;
186 lb->second.def_phi_blocks_->SetBit(check_cast->bb);
229 for (BasicBlock* bb = iter.Next(); bb != nullptr; bb = iter.Next()) {
230 if (bb->data_flow_info == nullptr || bb->block_type == kEntryBlock) {
233 BasicBlockId bb_id = bb->id;
238 if (IsSRegLiveAtStart(bb, v_reg, s_reg)) {
240 BasicBlock* pred_bb = FindTopologicallyEarliestPredecessor(bb);
279 Start(BasicBlock* bb) argument
285 ProcessPseudoPhis(BasicBlock* bb, Type* sregs) argument
338 BasicBlock* bb = mir_graph_->GetBasicBlock(check_cast->bb); local
355 FindTopologicallyEarliestPredecessor(BasicBlock* bb) argument
373 IsSRegLiveAtStart(BasicBlock* bb, int v_reg, int32_t s_reg) argument
413 Apply(BasicBlock* bb) argument
1052 PhiInputModifiedSReg(int32_t s_reg, BasicBlock* bb, size_t pred_idx) argument
[all...]
H A Dpost_opt_passes.h240 BasicBlock* bb = down_cast<PassMEDataHolder*>(data)->bb; local
241 DCHECK(bb != nullptr);
242 c_unit->mir_graph->InsertPhiNodeOperands(bb);
286 BasicBlock* bb = pass_me_data_holder->bb; local
287 DCHECK(bb != nullptr);
288 return c_unit->mir_graph->InferTypes(bb);
H A Dmir_graph.h335 BasicBlockId bb; member in class:art::MIR
356 explicit MIR() : offset(0), optimization_flags(0), m_unit_index(0), bb(NullBasicBlockId),
512 * @param bb The basic whose children we need to iterate through.
515 ChildBlockIterator(BasicBlock* bb, MIRGraph* mir_graph);
1109 MIR* FindMoveResult(BasicBlock* bb, MIR* mir);
1119 bool EliminateNullChecks(BasicBlock* bb);
1122 bool InferTypes(BasicBlock* bb);
1125 bool EliminateClassInitChecks(BasicBlock* bb);
1128 bool ApplyGlobalValueNumbering(BasicBlock* bb);
1131 bool EliminateDeadCode(BasicBlock* bb);
[all...]
H A Dmir_dataflow.cc985 bool MIRGraph::FindLocalLiveIn(BasicBlock* bb) { argument
989 if (bb->data_flow_info == nullptr) return false;
991 use_v = bb->data_flow_info->use_v =
993 def_v = bb->data_flow_info->def_v =
995 live_in_v = bb->data_flow_info->live_in_v =
998 for (mir = bb->first_mir_insn; mir != nullptr; mir = mir->next) {
1187 bool MIRGraph::DoSSAConversion(BasicBlock* bb) { argument
1188 if (bb->data_flow_info == nullptr) return false;
1194 BasicBlockId bb_id = bb->id;
1197 if (!bb
1397 CountUses(BasicBlock* bb) argument
1415 VerifyPredInfo(BasicBlock* bb) argument
[all...]
H A Dgvn_dead_code_elimination_test.cc94 #define DEF_CONST(bb, opcode, reg, value) \
95 { bb, opcode, value, 0u, 0, { }, 1, { reg } }
96 #define DEF_CONST_WIDE(bb, opcode, reg, value) \
97 { bb, opcode, value, 0u, 0, { }, 2, { reg, reg + 1 } }
98 #define DEF_CONST_STRING(bb, opcode, reg, index) \
99 { bb, opcode, index, 0u, 0, { }, 1, { reg } }
100 #define DEF_IGET(bb, opcode, reg, obj, field_info) \
101 { bb, opcode, 0u, field_info, 1, { obj }, 1, { reg } }
102 #define DEF_IGET_WIDE(bb, opcode, reg, obj, field_info) \
103 { bb, opcod
199 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); local
266 BasicBlock* bb = cu_.mir_graph->block_list_[def->bbid]; local
[all...]
H A Dpass_driver_me.h41 pass_me_data_holder_.bb = nullptr;
192 for (BasicBlock* bb = iterator->Next(change); bb != nullptr; bb = iterator->Next(change)) {
193 data->bb = bb;
H A Dmir_graph_test.cc69 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); local
71 bb->successor_block_list_type = kNotUsed;
72 bb->fall_through = (def->num_successors >= 1) ? def->successors[0] : 0u;
73 bb->taken = (def->num_successors >= 2) ? def->successors[1] : 0u;
75 bb->successor_block_list_type = kPackedSwitch;
76 bb->fall_through = 0u;
77 bb->taken = 0u;
78 bb->successor_blocks.reserve(def->num_successors);
85 bb->successor_blocks.push_back(successor_block_info);
88 bb
[all...]
H A Dtype_inference_test.cc97 #define DEF_CONST(bb, opcode, reg, value) \
98 { bb, opcode, value, 0u, 0, { }, 1, { reg } }
99 #define DEF_CONST_WIDE(bb, opcode, reg, value) \
100 { bb, opcode, value, 0u, 0, { }, 2, { reg, reg + 1 } }
101 #define DEF_CONST_STRING(bb, opcode, reg, index) \
102 { bb, opcode, index, 0u, 0, { }, 1, { reg } }
103 #define DEF_IGET(bb, opcode, reg, obj, field_info) \
104 { bb, opcode, 0u, field_info, 1, { obj }, 1, { reg } }
105 #define DEF_IGET_WIDE(bb, opcode, reg, obj, field_info) \
106 { bb, opcod
311 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); local
392 BasicBlock* bb = cu_.mir_graph->block_list_[def->bbid]; local
463 BasicBlock* bb = cu_.mir_graph->GetBasicBlock(bb_id); local
[all...]
H A Dmir_analysis.cc960 void MIRGraph::AnalyzeBlock(BasicBlock* bb, MethodStats* stats) { argument
961 if (bb->visited || (bb->block_type != kDalvikByteCode)) {
971 BasicBlock* ending_bb = bb;
988 if ((GetBasicBlock(ending_bb->taken)->taken == bb->id) ||
989 (GetBasicBlock(ending_bb->taken)->fall_through == bb->id)) {
994 if ((ending_bb->taken != NullBasicBlockId) && (ending_bb->taken == bb->id)) {
998 BasicBlock* tbb = bb;
1199 for (BasicBlock* bb = iter.Next(); bb !
[all...]
H A Dmir_optimization_test.cc84 #define DEF_SGET_SPUT(bb, opcode, vA, field_info) \
85 { bb, opcode, field_info, vA, 0u, 0u }
86 #define DEF_IGET_IPUT(bb, opcode, vA, vB, field_info) \
87 { bb, opcode, field_info, vA, vB, 0u }
88 #define DEF_AGET_APUT(bb, opcode, vA, vB, vC) \
89 { bb, opcode, 0u, vA, vB, vC }
90 #define DEF_INVOKE(bb, opcode, vC, method_info) \
91 { bb, opcode, method_info, 0u, 0u, vC }
92 #define DEF_OTHER0(bb, opcode) \
93 { bb, opcod
108 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); local
290 BasicBlock* bb = cu_.mir_graph->block_list_[def->bbid]; local
[all...]
H A Dglobal_value_numbering_test.cc94 #define DEF_CONST(bb, opcode, reg, value) \
95 { bb, opcode, value, 0u, 0, { }, 1, { reg } }
96 #define DEF_CONST_WIDE(bb, opcode, reg, value) \
97 { bb, opcode, value, 0u, 0, { }, 2, { reg, reg + 1 } }
98 #define DEF_CONST_STRING(bb, opcode, reg, index) \
99 { bb, opcode, index, 0u, 0, { }, 1, { reg } }
100 #define DEF_IGET(bb, opcode, reg, obj, field_info) \
101 { bb, opcode, 0u, field_info, 1, { obj }, 1, { reg } }
102 #define DEF_IGET_WIDE(bb, opcode, reg, obj, field_info) \
103 { bb, opcod
192 BasicBlock* bb = cu_.mir_graph->CreateNewBB(def->type); local
238 BasicBlock* bb = cu_.mir_graph->block_list_[def->bbid]; local
280 BasicBlock* bb = cu_.mir_graph->GetBasicBlock(bb_id); local
[all...]
/art/test/005-annotations/src/android/test/anno/
H A DAnnoArrayField.java11 byte[] bb() default {};
/art/test/009-instanceof/src/
H A DMain.java24 ImplBSub bb = new ImplBSub();
28 face1 = bb;
32 System.out.println("bb.mWhoami = " + bb.mWhoami);
41 bb = (ImplBSub) face1;
/art/compiler/dex/quick/
H A Dmir_to_lir.cc394 bool Mir2Lir::GenSpecialCase(BasicBlock* bb, MIR* mir, const InlineMethod& special) { argument
419 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
428 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
432 return_mir = bb->GetNextUnconditionalMir(mir_graph_, mir);
476 void Mir2Lir::CompileDalvikInstruction(MIR* mir, BasicBlock* bb, LIR* label_list) { argument
656 GenFilledNewArray(mir_graph_->NewMemCallInfo(bb, mir, kStatic,
661 GenFilledNewArray(mir_graph_->NewMemCallInfo(bb, mir, kStatic,
672 if (mir_graph_->IsBackEdge(bb, bb->taken)) {
673 GenSuspendTestAndBranch(opt_flags, &label_list[bb
1136 HandleExtendedMethodMIR(BasicBlock* bb, MIR* mir) argument
1209 MethodBlockCodeGen(BasicBlock* bb) argument
1302 BasicBlock*bb = nullptr; local
[all...]
H A Ddex_file_method_inliner.h95 bool GenInline(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke, uint32_t method_idx)
360 static bool GenInlineConst(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
362 static bool GenInlineReturnArg(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
364 static bool GenInlineIGet(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
366 static bool GenInlineIPut(MIRGraph* mir_graph, BasicBlock* bb, MIR* invoke,
H A Dcodegen_util.cc561 BasicBlock* bb = mir_graph_->GetBasicBlock(tab_rec->switch_mir->bb); local
562 DCHECK(bb != nullptr);
564 for (SuccessorBlockInfo* successor_block_info : bb->successor_blocks) {
584 BasicBlock* bb = mir_graph_->GetBasicBlock(tab_rec->switch_mir->bb); local
585 DCHECK(bb != nullptr);
588 for (SuccessorBlockInfo* successor_block_info : bb->successor_blocks) {
933 BasicBlock* bb = mir_graph_->GetBasicBlock(bbid); local
934 DCHECK(bb !
1356 GenMachineSpecificExtendedMethodMIR(BasicBlock* bb, MIR* mir) argument
1362 InitReferenceVRegs(BasicBlock* bb, BitVector* references) argument
1437 BasicBlock* bb = mir_graph_->GetBasicBlock(mir->bb); local
[all...]
/art/test/451-spill-splot/src/
H A DMain.java34 float bb = 1;
49 System.out.println(aa + bb + cc + dd + ee + ff + gg + hh + ii + jj + kk + ll + mm + nn);
63 bb = computeFloat();

Completed in 554 milliseconds

123