64     HBasicBlock* blk = graph_->GetBlocks()[id];  in GetBlock()  local
65     DCHECK(blk != nullptr);  in GetBlock()
66     return blk;  in GetBlock()
153     bool IsEntryBlock(const HBasicBlock* blk) const {  in IsEntryBlock()  argument
154       return entry_blocks_.IsBitSet(blk->GetBlockId());  in IsEntryBlock()
167     bool ContainsBlock(const HBasicBlock* blk) const {  in ContainsBlock()  argument
168       return blocks_.IsBitSet(blk->GetBlockId());  in ContainsBlock()
174     bool SucceedsBlock(const HBasicBlock* blk) const {  in SucceedsBlock()  argument
175       if (ContainsBlock(blk)) {  in SucceedsBlock()
180         return blk->GetGraph()->PathBetween(blk->GetBlockId(), entry);  in SucceedsBlock()
187     bool PrecedesBlock(const HBasicBlock* blk) const {  in PrecedesBlock()  argument
188       if (ContainsBlock(blk)) {  in PrecedesBlock()
193         return blk->GetGraph()->PathBetween(exit, blk->GetBlockId());  in PrecedesBlock()
239   bool ContainsBlock(const HBasicBlock* blk) const {  in ContainsBlock()  argument
244     return !unreachable_blocks_.IsBitSet(blk->GetBlockId());  in ContainsBlock()
281     bool operator()(HBasicBlock* blk) const {  in operator()
282       return subgraph_->ContainsBlock(blk);  in operator()
302     return std::all_of(graph->GetBlocks().begin(), graph->GetBlocks().end(), [](HBasicBlock* blk) {  in CanAnalyse()
303       return blk == nullptr || blk->GetSuccessors().size() <= kMaxFilterableSuccessors;  in CanAnalyse()
308   std::bitset<kMaxFilterableSuccessors> GetAllowedSuccessors(const HBasicBlock* blk) const {  in GetAllowedSuccessors()  argument
310     return allowed_successors_[blk->GetBlockId()];  in GetAllowedSuccessors()