1925       BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id);  in ComputeUnvisitedReachableFrom()  local
1926       DCHECK(pred_bb != nullptr);  in ComputeUnvisitedReachableFrom()
1927       if (!pred_bb->visited && !reachable->IsBitSet(pred_bb->id)) {  in ComputeUnvisitedReachableFrom()
1928         reachable->SetBit(pred_bb->id);  in ComputeUnvisitedReachableFrom()
1929         tmp_stack->push_back(pred_bb->id);  in ComputeUnvisitedReachableFrom()
2035           BasicBlock* pred_bb = GetBasicBlock(pred_id);  in ComputeTopologicalSortOrder()  local
2036           DCHECK(pred_bb != nullptr);  in ComputeTopologicalSortOrder()
2037           if (pred_bb != candidate && !pred_bb->visited &&  in ComputeTopologicalSortOrder()
2038               !pred_bb->dominators->IsBitSet(candidate->id)) {  in ComputeTopologicalSortOrder()
2328     BasicBlock* pred_bb = mir_graph->GetBasicBlock(pred_id);  in Kill()  local
2329     DCHECK(pred_bb != nullptr);  in Kill()
2332     pred_bb->ReplaceChild(id, NullBasicBlockId);  in Kill()