57   explicit BlockIdToBlockTransformer(const HGraph* graph) : graph_(graph) {}  in BlockIdToBlockTransformer()
60     return graph_;  in GetGraph()
64     DCHECK_LT(id, graph_->GetBlocks().size()) << graph_->PrettyMethod();  in GetBlock()
65     HBasicBlock* blk = graph_->GetBlocks()[id];  in GetBlock()
75   const HGraph* const graph_;
131         : graph_(graph),  in ExcludedCohort()
132           entry_blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA),  in ExcludedCohort()
133           exit_blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA),  in ExcludedCohort()
134           blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA) {}  in ExcludedCohort()
150       return Filter(MakeIterationRange(graph_->GetReversePostOrder()),  in EntryBlocksReversePostOrder()
203       BitVecBlockRange res = MakeTransformRange(indexes, BlockIdToBlockTransformer(graph_));  in BlockIterRange()
209     HGraph* graph_;  variable
261     return MakeTransformRange(idxs, BlockIdToBlockTransformer(graph_));  in UnreachableBlocks()
295     return Filter(MakeIterationRange(graph_->GetBlocks()), ContainsFunctor(this));  in ReachableBlocks()
333   HGraph* graph_;  variable