From 16a42183aff1275ad238bf5fb2e6416ecebc16cd Mon Sep 17 00:00:00 2001 From: Vladimir Marko Date: Wed, 19 Feb 2025 09:55:20 +0000 Subject: Introduce `BitVectorView<>`. Initially implement only simple bit getter and setters and use the new class to avoid overheads of `ArenaBitVector` in a few places. Test: m test-art-host-gtest Test: testrunner.py --host --optimizing Bug: 331194861 Change-Id: Ie29dfcd02286770e07131e43b65e6e9fb044a924 --- compiler/optimizing/nodes.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'compiler/optimizing/nodes.cc') diff --git a/compiler/optimizing/nodes.cc b/compiler/optimizing/nodes.cc index fcac6cdf5e..9b5cc50e93 100644 --- a/compiler/optimizing/nodes.cc +++ b/compiler/optimizing/nodes.cc @@ -68,8 +68,8 @@ void HGraph::FindBackEdges(ArenaBitVector* visited) { // Allocate memory from local ScopedArenaAllocator. ScopedArenaAllocator allocator(GetArenaStack()); // Nodes that we're currently visiting, indexed by block id. - ArenaBitVector visiting( - &allocator, blocks_.size(), /* expandable= */ false, kArenaAllocGraphBuilder); + BitVectorView visiting = + ArenaBitVector::CreateFixedSize(&allocator, blocks_.size(), kArenaAllocGraphBuilder); // Number of successors visited from a given node, indexed by block id. ScopedArenaVector successors_visited(blocks_.size(), 0u, -- cgit v1.2.3-59-g8ed1b