Searched defs:entries (Results 1 - 8 of 8) sorted by relevance
/art/compiler/ |
H A D | gc_map_builder.h | 29 GcMapBuilder(std::vector<uint8_t>* table, size_t entries, uint32_t max_native_offset, argument 31 : entries_(entries), references_width_(entries != 0u ? references_width : 0u), 32 native_offset_width_(entries != 0 && max_native_offset != 0 35 in_use_(entries), table_(table) { 37 table->resize((EntryWidth() * entries) + sizeof(uint32_t)); 43 CHECK_LT(entries, 1U << 16); 44 (*table)[2] = entries & 0xFF; 45 (*table)[3] = (entries >> 8) & 0xFF; 89 // Number of entries i [all...] |
/art/runtime/ |
H A D | indirect_reference_table.cc | 273 ReferenceTable::Table entries; local 281 entries.push_back(GcRoot<mirror::Object>(obj)); 284 entries.push_back(GcRoot<mirror::Object>(obj)); 287 ReferenceTable::Dump(os, entries);
|
H A D | reference_table.cc | 46 << "overflowed (" << max_size_ << " entries)"; 151 void ReferenceTable::Dump(std::ostream& os, Table& entries) { argument 152 if (entries.empty()) { 157 // Dump the most recent N entries. 159 size_t count = entries.size(); 164 os << " Last " << (count - first) << " entries (of " << count << "):\n"; 166 mirror::Object* ref = entries[idx].Read(); 201 for (size_t i = 0; i < entries.size(); ++i) { 202 mirror::Object* entry = entries[i].Read();
|
/art/compiler/dex/quick/x86/ |
H A D | call_x86.cc | 35 int entries = table[1]; local 37 const int32_t* targets = &keys[entries]; 39 for (int i = 0; i < entries; i++) {
|
/art/runtime/interpreter/ |
H A D | interpreter_common.h | 319 const int32_t* entries = keys + size; local 320 DCHECK(IsAligned<4>(entries)); 331 return entries[mid];
|
/art/compiler/dex/portable/ |
H A D | mir_to_gbc.cc | 1672 ::llvm::Value* entries = irb_->getInt32(cu_->num_dalvik_registers); local 1673 irb_->CreateCall(func, entries);
|
/art/compiler/dex/quick/ |
H A D | codegen_util.cc | 833 int entries = table[1]; local 835 for (int i = 0; i < entries; i++) { 843 int entries = table[1]; local 845 const int32_t* targets = &keys[entries]; 846 for (int i = 0; i < entries; i++) { 870 * ushort size number of entries in the table; > 0 877 int entries = table[1]; local 879 const int32_t* targets = &keys[entries]; 881 << ", entries: " << std::dec << entries; local 899 int entries = table[1]; local [all...] |
H A D | gen_common.cc | 2013 const uint16_t entries = table[1]; local 2020 for (; i < entries; i++, current_key++) { 2029 if (i < entries) { 2034 for (; i < entries - 1; i++, current_key++) { 2045 for (; i < entries; i++, current_key++) { 2060 const uint16_t entries = table[1]; local 2061 if (entries <= kSmallSwitchThreshold) { 2071 const uint16_t entries = table[1]; local 2074 const int32_t* targets = &keys[entries]; 2076 for (int i = 0; i < entries; 2090 const uint16_t entries = table[1]; local [all...] |
Completed in 187 milliseconds