Lines Matching defs:bb
594 // BB ADD_LONG_2ADDR vA, vB
868 bool MIRGraph::FindLocalLiveIn(BasicBlock* bb) {
872 if (bb->data_flow_info == NULL) return false;
874 use_v = bb->data_flow_info->use_v =
876 def_v = bb->data_flow_info->def_v =
878 live_in_v = bb->data_flow_info->live_in_v =
881 for (mir = bb->first_mir_insn; mir != NULL; mir = mir->next) {
987 bool MIRGraph::DoSSAConversion(BasicBlock* bb) {
990 if (bb->data_flow_info == NULL) return false;
992 for (mir = bb->first_mir_insn; mir != NULL; mir = mir->next) {
1111 bb->data_flow_info->vreg_to_ssa_map =
1115 memcpy(bb->data_flow_info->vreg_to_ssa_map, vreg_to_ssa_map_,
1170 BasicBlock* bb = iterator.Next();
1171 if (bb == NULL) break;
1172 if (bb->hidden == true) continue;
1173 if (bb->block_type == kDalvikByteCode ||
1174 bb->block_type == kEntryBlock ||
1175 bb->block_type == kExitBlock) {
1176 bb->data_flow_info =
1238 bool MIRGraph::CountUses(struct BasicBlock* bb) {
1239 if (bb->block_type != kDalvikByteCode) {
1242 for (MIR* mir = bb->first_mir_insn; (mir != NULL); mir = mir->next) {
1246 uint32_t weight = std::min(16U, static_cast<uint32_t>(bb->nesting_depth));
1291 for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) {
1292 CountUses(bb);
1297 bool MIRGraph::VerifyPredInfo(BasicBlock* bb) {
1298 GrowableArray<BasicBlock*>::Iterator iter(bb->predecessors);
1304 if (pred_bb->taken == bb) {
1306 } else if (pred_bb->fall_through == bb) {
1314 if (succ_bb == bb) {
1322 GetBlockName(bb, block_name1);
1335 for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) {
1336 VerifyPredInfo(bb);
