Home
last modified time | relevance | path

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

/art/libartbase/base/
Dbit_utils_test.cc27 static_assert(31 == CLZ<uint32_t>(1u), "TestCLZ32#1");
28 static_assert(30 == CLZ<uint32_t>(2u), "TestCLZ32#2");
29 static_assert(16 == CLZ<uint32_t>(0x00008765u), "TestCLZ32#3");
30 static_assert(15 == CLZ<uint32_t>(0x00012345u), "TestCLZ32#4");
31 static_assert(1 == CLZ<uint32_t>(0x43214321u), "TestCLZ32#5");
32 static_assert(0 == CLZ<uint32_t>(0x87654321u), "TestCLZ32#6");
35 static_assert(63 == CLZ<uint64_t>(UINT64_C(1)), "TestCLZ64#1");
36 static_assert(62 == CLZ<uint64_t>(UINT64_C(3)), "TestCLZ64#2");
37 static_assert(48 == CLZ<uint64_t>(UINT64_C(0x00008765)), "TestCLZ64#3");
38 static_assert(32 == CLZ<uint64_t>(UINT64_C(0x87654321)), "TestCLZ64#4");
[all …]
Dbit_utils.h47 constexpr int CLZ(T x) { in CLZ() function
65 return (x == 0) ? BitSizeOf<T>() : CLZ(static_cast<unsigned_type>(x)); in JAVASTYLE_CLZ()
111 return (value == 0) ? -1 : std::numeric_limits<T>::digits - 1 - CLZ(value); in MostSignificantBit()
133 return (x < 2u) ? x : static_cast<T>(1u) << (std::numeric_limits<T>::digits - CLZ(x - 1u)); in RoundUpToPowerOfTwo()
141 return (val != 0) ? static_cast<T>(1u) << (BitSizeOf<T>() - CLZ(val) - 1u) : 0; in TruncToPowerOfTwo()
342 int bit_position = BitSizeOf<T>() - (CLZ(static_cast<unsigned_type>(opnd)) + 1); in HighestOneBitValue()
Dleb128.h204 uint32_t x = 6 + 32 - CLZ(data | 1U); in UnsignedLeb128Size()
242 uint32_t x = 1 /* we need to encode the sign bit */ + 6 + 32 - CLZ(data | 1U); in SignedLeb128Size()
Dbit_utils_iterator.h95 return std::numeric_limits<T>::digits - 1u - CLZ(this->bits_);
Dbit_vector.cc282 return 31 - CLZ(value) + (idx * kWordBits); in GetHighestBitSet()
Dmem_map.cc125 constexpr size_t leading_zeros = CLZ(static_cast<uint32_t>(ART_BASE_ADDRESS)); in CreateStartPos()