HomeSort by relevance Sort by last modified time
    Searched full:num_entries_ (Results 1 - 4 of 4) sorted by null

  /art/compiler/optimizing/
bytecode_utils.h 65 num_entries_ = table[1];
70 return num_entries_;
75 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
76 DCHECK_LT(index, 2 * static_cast<size_t>(num_entries_));
78 // In a packed table, we have the starting key and num_entries_ values.
79 DCHECK_LT(index, 1 + static_cast<size_t>(num_entries_));
98 // In a sparse table, we have num_entries_ keys and num_entries_ values, in that order.
99 return num_entries_;
121 uint16_t num_entries_; member in class:art::DexSwitchTable
160 const size_t num_entries_; member in class:art::DexSwitchTableIterator
    [all...]
nodes_x86.h 88 num_entries_(num_entries) {
97 int32_t GetNumEntries() const { return num_entries_; }
105 return GetBlock()->GetSuccessors()[num_entries_];
112 const int32_t num_entries_; member in class:art::HX86PackedSwitch
gvn.cc 44 num_entries_(0u) {
57 num_entries_(0u) {
94 ++num_entries_;
135 num_entries_ = 0;
157 bool IsEmpty() const { return num_entries_ == 0; }
158 size_t GetNumberOfEntries() const { return num_entries_; }
198 num_entries_ = other.num_entries_;
300 // This is estimated as (num_entries_ * 1.5) and rounded up to nearest pow2.
302 size_t bucket_count = RoundUpToPowerOfTwo(num_entries_ + (num_entries_ >> 1))
341 size_t num_entries_; member in class:art::ValueSet
    [all...]
nodes.h 2898 const uint32_t num_entries_; member in class:art::HTryBoundary::HClassTableGet::HPackedSwitch
    [all...]

Completed in 271 milliseconds