Searched refs:entries (Results 1 - 10 of 10) sorted by relevance
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
H A D | AnnotationSetItem.java | 23 public AnnotationOffItem[] entries; field in class:AnnotationSetItem 30 entries = new AnnotationOffItem[size]; 32 (entries[i] = new AnnotationOffItem()).read(file); 41 for (AnnotationOffItem annotationOffItem : entries) {
|
/art/compiler/ |
H A D | gc_map_builder.h | 30 GcMapBuilder(std::vector<uint8_t, Alloc>* table, size_t entries, uint32_t max_native_offset, argument 32 : entries_(entries), references_width_(entries != 0u ? references_width : 0u), 33 native_offset_width_(entries != 0 && max_native_offset != 0 36 in_use_(entries) { 38 table->resize((EntryWidth() * entries) + sizeof(uint32_t)); 45 CHECK_LT(entries, 1U << 16); 46 (*table)[2] = entries & 0xFF; 47 (*table)[3] = (entries >> 8) & 0xFF; 91 // Number of entries i [all...] |
/art/runtime/ |
H A D | reference_table.cc | 47 << "overflowed (" << max_size_ << " entries)"; 118 void ReferenceTable::Dump(std::ostream& os, Table& entries) { argument 151 if (entries.empty()) { 156 // Dump the most recent N entries. 158 size_t count = entries.size(); 163 os << " Last " << (count - first) << " entries (of " << count << "):\n"; 166 mirror::Object* ref = entries[idx].Read(); 201 for (GcRoot<mirror::Object>& root : entries) {
|
H A D | reference_table.h | 58 static void Dump(std::ostream& os, Table& entries)
|
H A D | indirect_reference_table.cc | 282 ReferenceTable::Table entries; local 287 entries.push_back(GcRoot<mirror::Object>(obj)); 290 ReferenceTable::Dump(os, entries);
|
/art/compiler/dwarf/ |
H A D | headers.h | 112 const DebugInfoEntryWriter<Allocator>& entries, 120 writer.PushUint8(entries.Is64bit() ? 8 : 4); 122 writer.PushData(entries.data()); 125 for (uintptr_t patch_location : entries.GetPatchLocations()) { 111 WriteDebugInfoCU(uint32_t debug_abbrev_offset, const DebugInfoEntryWriter<Allocator>& entries, std::vector<uint8_t>* debug_info, std::vector<uintptr_t>* debug_info_patches) argument
|
/art/tools/dexfuzz/src/dexfuzz/ |
H A D | Options.java | 272 String[] entries = line.split(" "); 273 String name = entries[0].toLowerCase(); 274 int likelihood = Integer.parseInt(entries[1]);
|
/art/runtime/interpreter/ |
H A D | interpreter_common.h | 332 const int32_t* entries = keys + size; local 333 DCHECK(IsAligned<4>(entries)); 344 return entries[mid];
|
/art/compiler/dex/quick/ |
H A D | gen_common.cc | 2164 const uint16_t entries = table[1]; local 2170 for (; i < entries; ++i, ++succ_bb_iter) { 2181 if (i < entries) { 2186 for (; i < entries - 1; ++i, ++succ_bb_iter) { 2201 for (; i < entries; ++i, ++succ_bb_iter) { 2218 const uint16_t entries = table[1]; local 2219 if (entries <= kSmallSwitchThreshold) { 2231 const uint16_t entries = table[1]; local 2241 DCHECK_EQ(i, entries); 2250 const uint16_t entries local [all...] |
H A D | codegen_util.cc | 950 * ushort size number of entries in the table; > 0 957 int entries = table[1]; local 959 const int32_t* targets = &keys[entries]; 961 << ", entries: " << std::dec << entries; local 962 for (int i = 0; i < entries; i++) { 971 * ushort size number of entries in the table 979 int entries = table[1]; local 982 << ", entries: " << std::dec << entries << ", low_ke [all...] |
Completed in 352 milliseconds