Home
last modified time | relevance | path

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

/art/libartbase/base/
Dbit_string.h149 static constexpr size_t kCapacity = arraysize(kBitSizeAtPosition); // MaxBitstringLen above. member
155 while (idx < position && idx < kCapacity) { in GetBitLengthTotalAtPosition()
167 DCHECK_GE(kCapacity, position); in GetLsbForPosition()
174 if (position >= kCapacity) { in MaybeGetBitLengthAtPosition()
183 DCHECK_LT(idx, kCapacity);
194 DCHECK_LT(idx, kCapacity); in SetAt()
210 for (i = kCapacity - 1u; ; --i) { in Length()
222 return kCapacity - num_trailing_zeros; in Length()
232 return GetBitLengthTotalAtPosition(kCapacity); in BitStructSizeOf()
256 DCHECK_GE(kCapacity, end); in Truncate()
[all …]
Dbit_string_test.cc24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity; member in art::BitString
48 CHECK_GE(BitString::kCapacity, values.size());
69 template <size_t kCount = BitString::kCapacity>
92 ASSERT_LE(3u, BitString::kCapacity); in TEST()
110 ASSERT_EQ(BitString::kCapacity, 3u); in TEST()
143 EXPECT_EQ(MaskLeastSignificant(BitString::GetBitLengthTotalAtPosition(BitString::kCapacity)), in TEST()
158 ASSERT_LE(3u, BitString::kCapacity); in TEST()
/art/runtime/
Dsubtype_check_info_test.cc24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity; member in art::BitString
48 CHECK_GE(BitString::kCapacity, values.size());
69 template <size_t kCount = BitString::kCapacity>
157 ASSERT_LE(3u, BitString::kCapacity); in TEST_F()
214 /*depth=*/BitString::kCapacity).GetState()); in TEST_F()
216 MakeSubtypeCheckInfo(/*path_to_root=*/MakeBitStringMax<BitString::kCapacity - 1u>(), in TEST_F()
219 /*depth=*/BitString::kCapacity).GetState()); in TEST_F()
225 /*depth=*/BitString::kCapacity + 1u).GetState()); in TEST_F()
243 EXPECT_FALSE(HasNext(MakeSubtypeCheckInfoUnchecked(MakeBitStringMax<BitString::kCapacity>(), in TEST_F()
[all …]
Dsubtype_check_info.h402 return depth_ < BitString::kCapacity; in HasNext()
410 return idx < BitString::kCapacity; in HasBitStringCharStorage()
420 return std::min(depth, BitString::kCapacity); in GetSafeDepth()
465 for (i = 0; i < BitString::kCapacity; ++i) { in DcheckInvariants()
473 for (; i < BitString::kCapacity; ++i) { in DcheckInvariants()
Dsubtype_check_test.cc24 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
25 constexpr size_t BitString::kCapacity; member in art::BitString
307 CreateRootedTree(BitString::kCapacity + 2u, BitString::kCapacity + 2u); in SetUp()
693 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity; in TEST_F()
765 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity + 1u; in TEST_F()
772 if (kls->Depth() > BitString::kCapacity) { in TEST_F()
789 constexpr size_t kMaxDepthForThisTest = BitString::kCapacity + 2u; in TEST_F()
796 if (kls->Depth() > BitString::kCapacity) { in TEST_F()
812 if (depth > BitString::kCapacity) { in MaxWidthCutOff()
837 if (kls->Depth() > BitString::kCapacity) { in IsTooDeep()
[all …]
/art/runtime/mirror/
Dclass.cc54 constexpr size_t BitString::kBitSizeAtPosition[BitString::kCapacity];
55 constexpr size_t BitString::kCapacity; member in art::BitString