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

/art/runtime/
H A Dreference_table.cc45 << "overflowed (" << max_size_ << " entries)";
147 void ReferenceTable::Dump(std::ostream& os, const Table& entries) { argument
148 if (entries.empty()) {
153 // Dump the most recent N entries.
155 size_t count = entries.size();
160 os << " Last " << (count - first) << " entries (of " << count << "):\n";
162 const mirror::Object* ref = entries[idx];
196 Table sorted_entries(entries.begin(), entries.end());
/art/compiler/dex/quick/x86/
H A Dcall_x86.cc40 int entries = table[1]; local
42 const int* targets = &keys[entries];
44 for (int i = 0; i < entries; i++) {
/art/compiler/dex/quick/
H A Dcodegen_util.cc555 size_t entries, uint32_t max_native_offset,
556 size_t references_width) : entries_(entries),
557 references_width_(references_width), in_use_(entries),
566 table->resize((EntryWidth() * entries) + sizeof(uint32_t));
572 CHECK_LT(entries, 1U << 16);
573 (*table)[2] = entries & 0xFF;
574 (*table)[3] = (entries >> 8) & 0xFF;
618 // Number of entries in the table.
810 int entries = table[1]; local
812 for (int i = 0; i < entries;
554 NativePcToReferenceMapBuilder(std::vector<uint8_t>* table, size_t entries, uint32_t max_native_offset, size_t references_width) argument
820 int entries = table[1]; local
854 int entries = table[1]; local
858 << ", entries: " << std::dec << entries; local
876 int entries = table[1]; local
[all...]
/art/runtime/interpreter/
H A Dinterpreter.cc989 const int32_t* entries = keys + size; local
990 DCHECK(IsAligned<4>(entries));
1001 return inst->RelativeAt(entries[mid]);
/art/compiler/dex/portable/
H A Dmir_to_gbc.cc1655 ::llvm::Value* entries = irb_->getInt32(cu_->num_dalvik_registers); local
1656 irb_->CreateCall(func, entries);

Completed in 140 milliseconds