Searched defs:num_entries_ (Results 1 - 5 of 5) sorted by relevance

/art/compiler/optimizing/
H A Dnodes_mips.h51 num_entries_(num_entries) {
60 int32_t GetNumEntries() const { return num_entries_; }
64 return GetBlock()->GetSuccessors()[num_entries_];
74 const int32_t num_entries_; member in class:art::FINAL
H A Dnodes_x86.h101 num_entries_(num_entries) {
110 int32_t GetNumEntries() const { return num_entries_; }
118 return GetBlock()->GetSuccessors()[num_entries_];
128 const int32_t num_entries_; member in class:art::FINAL
H A Dgvn.cc45 num_entries_(0u) {
59 num_entries_(0u) {
96 ++num_entries_;
137 num_entries_ = 0;
159 bool IsEmpty() const { return num_entries_ == 0; }
160 size_t GetNumberOfEntries() const { return num_entries_; }
186 num_entries_ = other.num_entries_;
288 // This is estimated as (num_entries_ * 1.5) and rounded up to nearest pow2.
290 size_t bucket_count = RoundUpToPowerOfTwo(num_entries_
332 size_t num_entries_; member in class:art::ValueSet
[all...]
H A Dnodes.h3381 num_entries_(num_entries) {
3391 uint32_t GetNumEntries() const { return num_entries_; }
3395 return GetBlock()->GetSuccessors()[num_entries_];
3404 const uint32_t num_entries_; member in class:art::FINAL::FINAL::FINAL
/art/libdexfile/dex/
H A Dbytecode_utils.h37 num_entries_ = table[1];
42 return num_entries_;
47 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
48 DCHECK_LT(index, 2 * static_cast<size_t>(num_entries_));
50 // In a packed table, we have the starting key and num_entries_ values.
51 DCHECK_LT(index, 1 + static_cast<size_t>(num_entries_));
70 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
71 return num_entries_;
93 uint16_t num_entries_; member in class:art::DexSwitchTable
132 const size_t num_entries_; member in class:art::DexSwitchTableIterator
[all...]

Completed in 312 milliseconds