Home
last modified time | relevance | path

Searched refs:bv (Results 1 – 6 of 6) sorted by relevance

/art/libartbase/base/
Dbit_vector_test.cc31 BitVector bv(kBits, false, Allocator::GetMallocAllocator()); in TEST() local
32 EXPECT_EQ(1U, bv.GetStorageSize()); in TEST()
33 EXPECT_EQ(sizeof(uint32_t), bv.GetSizeOf()); in TEST()
34 EXPECT_FALSE(bv.IsExpandable()); in TEST()
36 EXPECT_EQ(0U, bv.NumSetBits()); in TEST()
37 EXPECT_EQ(0U, bv.NumSetBits(1)); in TEST()
38 EXPECT_EQ(0U, bv.NumSetBits(kBits)); in TEST()
40 EXPECT_FALSE(bv.IsBitSet(i)); in TEST()
42 EXPECT_EQ(0U, bv.GetRawStorageWord(0)); in TEST()
43 EXPECT_EQ(0U, *bv.GetRawStorage()); in TEST()
[all …]
Dbit_vector.h309 BaseBitVectorArray(const BaseBitVectorArray& bv) = default;
369 static size_t MaxRowsFor(const BitVector& bv, size_t cols) { in MaxRowsFor() argument
370 return cols != 0 ? bv.GetBitSizeOf() / RoundUp(cols, BitVector::kWordBits) : 0; in MaxRowsFor()
384 BitVectorArray(const BitVectorArray& bv) = delete;
387 explicit BitVectorArray(BitVector&& bv) : BaseBitVectorArray(), data_(std::move(bv)) {} in BitVectorArray() argument
388 explicit BitVectorArray(BitVector&& bv, size_t cols) in BitVectorArray() argument
389 : BaseBitVectorArray(BaseBitVectorArray::MaxRowsFor(bv, cols), cols), data_(std::move(bv)) {} in BitVectorArray()
390 explicit BitVectorArray(BitVector&& bv, size_t rows, size_t cols) in BitVectorArray() argument
391 : BaseBitVectorArray(rows, cols), data_(std::move(bv)) {} in BitVectorArray()
423 explicit BitVectorArrayWrapper(BitVector* bv) : BaseBitVectorArray(), data_(bv) {} in BitVectorArrayWrapper() argument
[all …]
Darena_bit_vector.h64 ArenaBitVectorArray(const ArenaBitVectorArray& bv) = delete;
67 explicit ArenaBitVectorArray(ArenaBitVector&& bv) : BaseBitVectorArray(), data_(std::move(bv)) {} in ArenaBitVectorArray() argument
68 ArenaBitVectorArray(ArenaBitVector&& bv, size_t cols) in ArenaBitVectorArray() argument
69 : BaseBitVectorArray(BaseBitVectorArray::MaxRowsFor(bv, cols), cols), data_(std::move(bv)) {} in ArenaBitVectorArray()
Darena_allocator_test.cc40 ArenaBitVector bv(&allocator, 10, true); in TEST_F() local
41 bv.SetBit(5); in TEST_F()
42 EXPECT_EQ(1U, bv.GetStorageSize()); in TEST_F()
43 bv.SetBit(35); in TEST_F()
44 EXPECT_EQ(2U, bv.GetStorageSize()); in TEST_F()
/art/compiler/optimizing/
Dexecution_subgraph.h200 BitVecBlockRange BlockIterRange(const ArenaBitVector& bv) const { in BlockIterRange() argument
201 auto indexes = bv.Indexes(); in BlockIterRange()
Doptimizing_unit_test.h358 BitVector bv(preds.size(), false, Allocator::GetMallocAllocator()); in EnsurePredecessorOrder()
367 if (cur.first == pred && !bv.IsBitSet(cur.second)) { in EnsurePredecessorOrder()
368 bv.SetBit(cur.second); in EnsurePredecessorOrder()
375 bv.NumSetBits() == preds.size(); in EnsurePredecessorOrder()