Home
last modified time | relevance | path

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

/art/libartbase/base/
Dbit_table_test.cc50 constexpr uint32_t kNoValue = -1; in TEST() local
55 builder.Add({kNoValue}); in TEST()
57 builder.Add({kNoValue}); in TEST()
65 EXPECT_EQ(kNoValue, table.Get(1)); in TEST()
67 EXPECT_EQ(kNoValue, table.Get(3)); in TEST()
96 constexpr uint32_t kNoValue = -1; in TEST() local
100 builder.Add({42u, kNoValue, 0u, static_cast<uint32_t>(-2)}); in TEST()
101 builder.Add({62u, kNoValue, 63u, static_cast<uint32_t>(-3)}); in TEST()
109 EXPECT_EQ(kNoValue, table.Get(0, 1)); in TEST()
113 EXPECT_EQ(kNoValue, table.Get(1, 1)); in TEST()
Dbit_table.h42 static constexpr uint32_t kNoValue = std::numeric_limits<uint32_t>::max(); // == -1.
43 static constexpr uint32_t kValueBias = kNoValue; // Bias so that -1 is encoded as 0.
110 static constexpr uint32_t kNoValue = BitTableBase<kNumColumns>::kNoValue; variable
135 ALWAYS_INLINE bool Has##NAME() const { return Get##NAME() != kNoValue; } \
258 static constexpr uint32_t kNoValue = BitTableBase<kNumColumns>::kNoValue;
266 static constexpr uint32_t kNoValue = BitTableBase<kNumColumns>::kNoValue; in Entry() local
267 std::fill_n(data_, kNumColumns, kNoValue); in Entry()
/art/runtime/
Dstack_map.h330 return (index == StackMap::kNoValue) ? BitMemoryRegion() : GetStackMask(index); in GetStackMaskOf()
335 return (index == StackMap::kNoValue) ? 0 : register_masks_.GetRow(index).GetMask(); in GetRegisterMaskOf()
343 return (index == StackMap::kNoValue) in GetDexRegisterCatalogEntry()
390 if (index != StackMap::kNoValue) { in GetInlineInfosOf()
Dstack_map.cc138 if (mask_index == StackMap::kNoValue) { in DecodeDexRegisterMap()
148 DCHECK_NE(map_index, StackMap::kNoValue); in DecodeDexRegisterMap()
/art/compiler/optimizing/
Dstack_map_stream.h96 static constexpr uint32_t kNoValue = -1;
Dstack_map_stream.cc245 uint32_t index = reg.IsLive() ? dex_register_catalog_.Dedup(&entry) : kNoValue; in CreateDexRegisterMap()