59   block->SetBlockId(blocks_.size());  in AddBlock()
60   blocks_.push_back(block);  in AddBlock()
71       &allocator, blocks_.size(), /* expandable= */ false, kArenaAllocGraphBuilder);  in FindBackEdges()
74   ScopedArenaVector<size_t> successors_visited(blocks_.size(),  in FindBackEdges()
154   for (size_t i = 0; i < blocks_.size(); ++i) {  in RemoveInstructionsAsUsersFromDeadBlocks()
156       HBasicBlock* block = blocks_[i];  in RemoveInstructionsAsUsersFromDeadBlocks()
169   for (size_t i = 0; i < blocks_.size(); ++i) {  in RemoveDeadBlocks()
171       HBasicBlock* block = blocks_[i];  in RemoveDeadBlocks()
179       blocks_[i] = nullptr;  in RemoveDeadBlocks()
194   ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder);  in BuildDominatorTree()
277   DCHECK_LT(source_idx, blocks_.size()) << "source not present in graph!";  in PathBetween()
278   DCHECK_LT(dest_idx, blocks_.size()) << "dest not present in graph!";  in PathBetween()
279   DCHECK(blocks_[source_idx] != nullptr);  in PathBetween()
280   DCHECK(blocks_[dest_idx] != nullptr);  in PathBetween()
431   reachability_graph_.Resize(blocks_.size(), blocks_.size(), /*clear=*/false);  in ComputeReachabilityInformation()
442   reverse_post_order_.reserve(blocks_.size());  in ComputeDominanceInformation()
448   ScopedArenaVector<size_t> visits(blocks_.size(), 0u, allocator.Adapter(kArenaAllocGraphBuilder));  in ComputeDominanceInformation()
450   ScopedArenaVector<size_t> successors_visited(blocks_.size(),  in ComputeDominanceInformation()
484   for (HBasicBlock* block : blocks_) {  in ComputeDominanceInformation()
740   for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) {  in SimplifyCFG()
741     HBasicBlock* block = blocks_[block_id];  in SimplifyCFG()
804   for (uint32_t idx : blocks_.Indexes()) {  in Dump()
910   blocks_.SetBit(block->GetBlockId());  in Add()
914   blocks_.ClearBit(block->GetBlockId());  in Remove()
918   if (blocks_.IsBitSet(block->GetBlockId())) {  in PopulateRecursive()
922   blocks_.SetBit(block->GetBlockId());  in PopulateRecursive()
955     if (blocks_.IsBitSet(pre_header->GetBlockId())) {  in PopulateIrreducibleRecursive()
957       blocks_.SetBit(block_id);  in PopulateIrreducibleRecursive()
971       if (!is_finalized && blocks_.IsBitSet(predecessor->GetBlockId())) {  in PopulateIrreducibleRecursive()
973         blocks_.SetBit(block_id);  in PopulateIrreducibleRecursive()
987   DCHECK_EQ(blocks_.NumSetBits(), 0u) << "Loop information has already been populated";  in Populate()
994   blocks_.SetBit(header_->GetBlockId());  in Populate()
1046   blocks_.Union(&inner_loop->blocks_);  in PopulateInnerLoopUpwards()
1060   return blocks_.IsBitSet(block.GetBlockId());  in Contains()
1064   return other.blocks_.IsBitSet(header_->GetBlockId());  in IsIn()
1068   return !blocks_.IsBitSet(instruction->GetBlock()->GetBlockId());  in IsDefinedOutOfTheLoop()
2655   blocks_[block->GetBlockId()] = nullptr;  in DeleteDeadEmptyBlock()